퇴사

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

 

#include <iostream>
#include <algorithm>

using namespace std;

int n;
int t[16] = { 0 };
int p[16] = { 0 };
int result = 0;

void DFS(int day, int currentCost) {
	if (day == n + 1) {
		result = max(result, currentCost);
	}
	else {
		if (day + t[day] <= n + 1) DFS(day + t[day], currentCost + p[day]);
		DFS(day + 1, currentCost);
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin >> n;
	int i, j;
	int time, cost;
	for (i = 1; i <= n; i++) {
		cin >> time >> cost;
		t[i] = time;
		p[i] = cost;
	}
	DFS(1,0);
	cout << result << "\n";
	return 0;
}

 

#include <iostream>
#include <algorithm>

using namespace std;

int n;

int t[20];
int p[20];
int dp[20];

int main() {
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> t[i] >> p[i];
	for (int i = 1; i <= n; i++) {
		if(i+t[i]<=n+1) dp[i + t[i]] = max(dp[i + t[i]], dp[i] + p[i]);
		dp[i + 1] = max(dp[i + 1], dp[i]);
	}
	int answer = 0;
	for (int i = 1; i <= n + 1; i++) answer = max(answer, dp[i]);
	cout << answer << "\n";
	return 0;
}