# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47223 | szawinis | Candies (JOI18_candies) | C++17 | 19 ms | 17188 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;
using ll = long long;
const int N = 2e3+1;
int n;
ll a[N], dp[N][N], res[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for(int i = 1; i <= n; i++) {
cin >> a[i];
dp[i][1] = max(dp[i-1][1], a[i]);
res[1] = max(a[i], res[1]);
for(int j = 2; j <= i+1 >> 1; j++) {
dp[i][j] = max(dp[i-2][j-1] + a[i], dp[i-1][j]);
res[j] = max(dp[i][j], res[j]);
// cout << i << ' ' << j << ' ' << dp[i][j] << endl;
}
}
for(int i = 1; i <= n+1 >> 1; i++) cout << res[i] << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |