백준 14501번 : 퇴사

https://www.acmicpc.net/problem/14501

1. 문제

2. 알고리즘

키워드 - DP

3. 코드

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;
 
#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long
 
#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())
#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];
 
int dp[25];
 
int main() {
 
    cin.tie(0);
    std::ios::sync_with_stdio(false);
 
    int n; cin >> n;
 
    for (int i=0; i<n; i++) {
 
        int t, p; cin >> t >> p;
 
        if (dp[i] > dp[i+1]) {
            dp[i+1] = dp[i];
        }
 
        if (dp[i+t] < dp[i] + p) {
            dp[i+t] = dp[i] + p;
        }
    }
 
    cout << dp[n] << CENDL;
 
    return 0; 
}