# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
646901 | DobromirAngelov | Sum Zero (RMI20_sumzero) | C++14 | 269 ms | 15048 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.
#pragma optimize "O3"
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN=4e5+5;
const int INF=1e9+5;
int n,q;
pair<long long,int> pref[MAXN];
//int previous[MAXN];
int prv[MAXN];
int nxt_l[MAXN], r[MAXN];
int ans[MAXN];
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>n;
for(int i=1;i<=n;i++) cin>>pref[i].first;
for(int i=1;i<=n;i++)
{
pref[i].first=pref[i-1].first+pref[i].first;
pref[i].second=i;
}
sort(pref,pref+n+1);
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... |