# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
616010 |
2022-07-31T18:05:14 Z |
bebra |
Candies (JOI18_candies) |
C++17 |
|
44 ms |
37212 KB |
#include <bits/stdc++.h>
using namespace std;
#define dbg(x) cerr << #x << ": " << x << endl;
const int MAX_N = (int)2000;
long long dp[MAX_N][MAX_N / 2];
const long long MINUS_INF = -1e15;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<long long> a(n);
for (auto& x : a) cin >> x;
for (int i = 0; i < MAX_N; ++i) {
for (int j = 0; j < MAX_N / 2; ++j) {
dp[i][j] = MINUS_INF;
}
}
dp[0][0] = 0;
dp[0][1] = a[0];
for (int i = 1; i < n; ++i) {
dp[i][0] = 0;
for (int j = 1; j <= (i + 2) / 2; ++j) {
dp[i][j] = max(dp[i - 1][j], a[i] + (i >= 2 ? dp[i - 2][j - 1] : 0));
}
}
for (int j = 1; j <= (n + 1) / 2; ++j) {
cout << dp[n - 1][j] << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
15956 KB |
Output is correct |
2 |
Correct |
10 ms |
15956 KB |
Output is correct |
3 |
Correct |
10 ms |
15956 KB |
Output is correct |
4 |
Correct |
9 ms |
15916 KB |
Output is correct |
5 |
Correct |
10 ms |
15956 KB |
Output is correct |
6 |
Correct |
9 ms |
15912 KB |
Output is correct |
7 |
Correct |
10 ms |
15972 KB |
Output is correct |
8 |
Correct |
8 ms |
15956 KB |
Output is correct |
9 |
Correct |
9 ms |
16016 KB |
Output is correct |
10 |
Correct |
11 ms |
15956 KB |
Output is correct |
11 |
Correct |
10 ms |
15956 KB |
Output is correct |
12 |
Correct |
10 ms |
15956 KB |
Output is correct |
13 |
Correct |
11 ms |
15956 KB |
Output is correct |
14 |
Correct |
11 ms |
15956 KB |
Output is correct |
15 |
Correct |
10 ms |
15956 KB |
Output is correct |
16 |
Correct |
10 ms |
15956 KB |
Output is correct |
17 |
Correct |
10 ms |
15956 KB |
Output is correct |
18 |
Correct |
9 ms |
16004 KB |
Output is correct |
19 |
Correct |
9 ms |
15956 KB |
Output is correct |
20 |
Correct |
9 ms |
15956 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
15956 KB |
Output is correct |
2 |
Correct |
10 ms |
15956 KB |
Output is correct |
3 |
Correct |
10 ms |
15956 KB |
Output is correct |
4 |
Correct |
9 ms |
15916 KB |
Output is correct |
5 |
Correct |
10 ms |
15956 KB |
Output is correct |
6 |
Correct |
9 ms |
15912 KB |
Output is correct |
7 |
Correct |
10 ms |
15972 KB |
Output is correct |
8 |
Correct |
8 ms |
15956 KB |
Output is correct |
9 |
Correct |
9 ms |
16016 KB |
Output is correct |
10 |
Correct |
11 ms |
15956 KB |
Output is correct |
11 |
Correct |
10 ms |
15956 KB |
Output is correct |
12 |
Correct |
10 ms |
15956 KB |
Output is correct |
13 |
Correct |
11 ms |
15956 KB |
Output is correct |
14 |
Correct |
11 ms |
15956 KB |
Output is correct |
15 |
Correct |
10 ms |
15956 KB |
Output is correct |
16 |
Correct |
10 ms |
15956 KB |
Output is correct |
17 |
Correct |
10 ms |
15956 KB |
Output is correct |
18 |
Correct |
9 ms |
16004 KB |
Output is correct |
19 |
Correct |
9 ms |
15956 KB |
Output is correct |
20 |
Correct |
9 ms |
15956 KB |
Output is correct |
21 |
Runtime error |
44 ms |
37212 KB |
Execution killed with signal 11 |
22 |
Halted |
0 ms |
0 KB |
- |