# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287853 | dantoh000 | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 512 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>
#define fi first
#define se second
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
int n;
int a[500005];
ii dp[500005];
ll p[500005];
int main(){
scanf("%d",&n);
for (int i = 1 ; i <= n; i++){
scanf("%d",&a[i]);
p[i] = p[i-1]+a[i];
}
dp[0] = ii(0,0);
for (int i = 1; i <= n; i++){
for (int j = 0; j < i; j++){
if (p[i]-p[j] >= dp[j].se){
if (dp[i].fi < dp[j].fi+1 || (dp[i].fi == dp[j].fi+1 && dp[i].se > p[i]-p[j]) ){
dp[i] = {dp[j].fi+1, p[i]-p[j]};
}
}
}
}
printf("%d\n",dp[n].fi);
}
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... |