# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990295 | Celebi_276 | Candies (JOI18_candies) | C++17 | 5 ms | 16216 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define FILE "TEST"
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define fi first
#define se second
long long dp[2022][1011];
int n, a[2022];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
if (fopen(FILE".INP", "r")) {
freopen(FILE".INP", "r", stdin);
freopen(FILE".OUT", "w", stdout);
}
cin >> n;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 0; i <= n; i++)
for (int j = 1; j <= n; j++) dp[i][j] = -9E18;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= (n + 1) / 2; j++)
dp[i][j] = max(dp[i - 1][j], dp[max(i - 2, 0)][j - 1] + a[i]);
for (int j = 1; j <= (n + 1) / 2; j++) cout << dp[n][j] << "\n";
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |