oj.uz

Submission #486578

# Submission time Handle Problem Language Result Execution time Memory
486578 2021-11-12T04:41:17 Z ez_ioi Candies (JOI18_candies) C++17
0 / 100
 10 ms 22988 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int mxN = 2e3 + 5, mod = 1e9 + 7, LOG = 20;

int n;
ll a[mxN], dp[mxN][mxN];

int main() {
	ios :: sync_with_stdio(false), cin.tie(nullptr);
	cin >> n;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	for (int i = 1; i <= n; ++i) {
		dp[i][1] = max(dp[i - 1][1], a[i]);
		for (int j = 2; j <= i && i - j > 0; ++j)
			dp[i][j] = max(dp[i - 1][j], dp[i - 2][j - 1] + a[i]);
	}
	for (int i = 1; i <= (n + 1) / 2; ++i) cout << dp[n][i] << '\n';
	return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 22988 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 92.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 22988 KB Output isn't correct
2 Halted 0 ms 0 KB -