| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1355522 | ElayV13 | Sum Zero (RMI20_sumzero) | C++20 | 332 ms | 836 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=400001;
int n,q;
int a[N];
int f[N];
signed main(){
cin>>n;
for(int i=1;i<=n;i++) f[i]=-1;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++){
int sum=0;
for(int j=i;j<=n;j++){
sum+=a[j];
if(!sum){
f[i]=j;
break;
}
}
}
cin>>q;
while(q--){
int l,r;
cin>>l>>r;
vector<vector<int>>all;
for(int i=l;i<=r;i++) if(f[i]>0) all.push_back({f[i],i});
sort(all.begin(),all.end());
int res=0,last_r=-1;
for(vector<int>p:all){
if(p[1]>last_r){
++res;
last_r=p[0];
}
}
cout<<res<<'\n';
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
