#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)
#define int long long
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
candies.cpp:22:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main () {
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
14200 KB |
Output is correct |
2 |
Correct |
14 ms |
14200 KB |
Output is correct |
3 |
Correct |
14 ms |
14268 KB |
Output is correct |
4 |
Correct |
14 ms |
14336 KB |
Output is correct |
5 |
Correct |
14 ms |
14336 KB |
Output is correct |
6 |
Correct |
14 ms |
14384 KB |
Output is correct |
7 |
Correct |
14 ms |
14384 KB |
Output is correct |
8 |
Correct |
14 ms |
14384 KB |
Output is correct |
9 |
Correct |
14 ms |
14392 KB |
Output is correct |
10 |
Correct |
14 ms |
14544 KB |
Output is correct |
11 |
Correct |
14 ms |
14544 KB |
Output is correct |
12 |
Correct |
14 ms |
14636 KB |
Output is correct |
13 |
Correct |
14 ms |
14636 KB |
Output is correct |
14 |
Correct |
14 ms |
14636 KB |
Output is correct |
15 |
Correct |
14 ms |
14636 KB |
Output is correct |
16 |
Correct |
14 ms |
14636 KB |
Output is correct |
17 |
Correct |
15 ms |
14636 KB |
Output is correct |
18 |
Correct |
14 ms |
14636 KB |
Output is correct |
19 |
Correct |
14 ms |
14636 KB |
Output is correct |
20 |
Correct |
14 ms |
14636 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
17 ms |
14200 KB |
Output is correct |
2 |
Correct |
14 ms |
14200 KB |
Output is correct |
3 |
Correct |
14 ms |
14268 KB |
Output is correct |
4 |
Correct |
14 ms |
14336 KB |
Output is correct |
5 |
Correct |
14 ms |
14336 KB |
Output is correct |
6 |
Correct |
14 ms |
14384 KB |
Output is correct |
7 |
Correct |
14 ms |
14384 KB |
Output is correct |
8 |
Correct |
14 ms |
14384 KB |
Output is correct |
9 |
Correct |
14 ms |
14392 KB |
Output is correct |
10 |
Correct |
14 ms |
14544 KB |
Output is correct |
11 |
Correct |
14 ms |
14544 KB |
Output is correct |
12 |
Correct |
14 ms |
14636 KB |
Output is correct |
13 |
Correct |
14 ms |
14636 KB |
Output is correct |
14 |
Correct |
14 ms |
14636 KB |
Output is correct |
15 |
Correct |
14 ms |
14636 KB |
Output is correct |
16 |
Correct |
14 ms |
14636 KB |
Output is correct |
17 |
Correct |
15 ms |
14636 KB |
Output is correct |
18 |
Correct |
14 ms |
14636 KB |
Output is correct |
19 |
Correct |
14 ms |
14636 KB |
Output is correct |
20 |
Correct |
14 ms |
14636 KB |
Output is correct |
21 |
Runtime error |
129 ms |
33468 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
22 |
Halted |
0 ms |
0 KB |
- |