# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1003611 | ThegeekKnight16 | Cigle (COI21_cigle) | C++17 | 2 ms | 1372 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>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int N; cin >> N;
vector<int> v(N+1);
for (int i = 1; i <= N; i++) cin >> v[i]; v[0] = 0x3f3f3f3f;
vector<vector<int>> dp(N+1, vector<int>(N+1));
for (int l = 2; l <= N; l++)
{
vector<int> prefdp(N+1);
for (int k = 1; k < l; k++) prefdp[k] = max(prefdp[k-1], dp[k][l-1]);
// cerr << "l: " << l << '\n';
int sumL = v[l-1], sumR = 0, p = l-1, inters = 0, mSuf = 0;
for (int r = l; r <= N; r++)
{
while (p >= 1 && sumL <= sumR)
{
mSuf = max(mSuf, dp[p-1][l-1] + inters);
if (sumL == sumR) inters++;
sumL += v[--p];
}
dp[l][r] = max(prefdp[p] + inters, mSuf);
sumR += v[r];
// cerr << dp[l][r] << " ";
}
// cerr << '\n';
}
int resp = 0;
for (int i = 1; i <= N; i++) resp = max(resp, dp[i][N]);
cout << resp << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |