Skip to content

[Week02] BOJ: 퇴사2 #20

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
whqtker wants to merge 1 commit into
base: main
Choose a base branch
from
Open

[Week02] BOJ: 퇴사2 #20

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 27 additions & 0 deletions weekly/week02/BOJ_15486_퇴사2/whqtker.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,27 @@
#include <iostream>
#include <algorithm>

using namespace std;

int dp[1500051];
pair<int, int> consult[1500001]; // consult[i] = { x, y } : i일의 상담은 x일이 걸리며 수익은 y

int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x, y;
cin >> x >> y;
consult[i] = { x, y };
}

for (int i = 1; i <= n; i++) {
dp[i + 1] = max(dp[i + 1], dp[i]);

if (i + consult[i].first <= n + 1) {
dp[i + consult[i].first] = max(dp[i + consult[i].first], dp[i] + consult[i].second);
}
}

cout << dp[n + 1] << "\n";
}