# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218801 | Lawliet | Bigger segments (IZhO19_segments) | C++14 | 112 ms | 38904 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;
typedef long long int lli;
const int MAXN = 5010;
int n;
int v[MAXN];
int curMx[MAXN];
int dp[MAXN][MAXN];
lli sv[MAXN];
int main()
{
scanf("%d",&n);
for(int i = 1 ; i <= n ; i++)
scanf("%d",&v[i]);
for(int i = 1 ; i <= n ; i++)
sv[i] = sv[i - 1] + v[i];
for(int i = 1 ; i <= n ; i++)
dp[n + 1][i] = 1;
for(int i = n ; i > 0 ; i--)
{
int p = i;
for(int j = n ; j >= i ; j--)
{
curMx[j] = curMx[j + 1];
curMx[j] = max( curMx[j] , dp[j + 1][i] );
}
for(int j = i - 1 ; j >= 0 ; j--)
{
lli lastSum = sv[i - 1] - sv[j - 1];
while( p <= n && sv[p] - sv[i - 1] < lastSum )
p++;
dp[i][j] = curMx[p] + 1;
}
}
int ans = 0;
for(int i = 1 ; i <= n ; i++)
ans = max( ans , dp[i + 1][1] );
printf("%d\n",ans);
}
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... |