# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
990294 | 2024-05-30T06:54:18 Z | Celebi_276 | Candies (JOI18_candies) | C++17 | 6 ms | 16220 KB |
#include <bits/stdc++.h> using namespace std; #define FILE "TEST" #define all(v) v.begin(), v.end() #define rall(v) v.rbegin(), v.rend() #define fi first #define se second long long dp[2022][1011]; int n, a[2022]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); if (fopen(FILE".INP", "r")) { freopen(FILE".INP", "r", stdin); freopen(FILE".OUT", "w", stdout); } cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 0; i <= n; i++) for (int j = 1; j <= n; j++) dp[i][j] = LLONG_MIN; for (int i = 1; i <= n; i++) for (int j = 1; j <= n; j++) dp[i][j] = max(dp[i - 1][j], dp[max(i - 2, 0)][j - 1] + a[i]); for (int j = 1; j <= (n + 1) / 2; j++) cout << dp[n][j] << " "; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 16220 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 16220 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |