# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47833 | Talant | Candies (JOI18_candies) | C++17 | 11 ms | 8184 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>
#define mk make_pair
#define sc second
#define fr first
#define pb emplace_back
#define all(s) s.begin(), s.end()
#define sz(s) ( (int)s.size() )
#define Scan(a) scanf ("%I64d", &a)
#define scan(a) scanf ("%d", &a)
using namespace std;
const int inf = (int)1e9 + 7;
const int N = (int)2e5 + 7;
int n;
int a[N];
int dp[2005][1005];
main () {
cin >> n;
for (int i = 1; i <= n; i ++) {
cin >> a[i];
}
dp[1][1] = a[1];
for (int i = 2; i <= n; i ++) {
for (int j = 1; j <= (i + 1) / 2; j ++) {
dp[i][j] = max(dp[i - 2][j - 1] + a[i],dp[i - 1][j]);
}
}
for (int j = 1; j <= (n + 1) / 2; j ++)
cout << dp[n][j] << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |