# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499080 | ismoilov | Bigger segments (IZhO19_segments) | C++14 | 78 ms | 18916 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 ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
void S()
{
int n;
cin >> n;
vector <int> a(n+1);
fpp(i,1,n)
cin >> a[i];
vector <ll> pr(n+2), b(n+2), d(n+2);
fpp(i,1,n)
pr[i] = pr[i-1] + a[i];
fpp(i,1,n){
b[i] = max(b[i-1], b[i]);
d[i] = d[b[i]] + 1;
ll c = 2*pr[i] - pr[b[i]];
int x = lower_bound(pr.begin()+1, pr.begin()+1+n, c) - pr.begin();
b[x] = max(b[x], i*1ll);
}
cout << d[n];
}
int main()
{
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... |