반응형
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 | #include <iostream> #include <algorithm> using namespace std; int arr[301]; int dp[301]; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; for (int i = 1; i <= n; i++) cin >> arr[i]; dp[0] = 0; dp[1] = arr[1]; dp[2] = arr[1] + arr[2]; for (int i = 3; i <= n; i++) dp[i] = max(arr[i - 1] + dp[i - 3], dp[i - 2]) + arr[i]; cout << dp[n]; } | cs |
반응형