# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770949 | Amylopectin | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 316 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 <stdio.h>
#include <iostream>
using namespace std;
// const int mxn = 20;
const int mxn = 1e6 + 10;
int qsu[mxn] = {},lel[mxn] = {},sen[mxn] = {};
int main()
{
int i,j,n,m,cl,cr,mid;
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%d",&qsu[i]);
qsu[i] += qsu[i-1];
}
lel[1] = qsu[1];
sen[1] = 1;
for(i=2; i<=n; i++)
{
cl = 1;
cr = i;
while(cl < cr)
{
mid = (cl+cr) / 2 + (cl+cr) % 2;
if(qsu[i] - qsu[mid-1] >= lel[mid-1])
{
cl = mid;
}
else
{
cr = mid-1;
}
}
lel[i] = qsu[i] - qsu[cl-1];
sen[i] = sen[cl-1] + 1;
}
printf("%d\n",sen[n]);
return 0;
}
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... |