Submission #1177920

#TimeUsernameProblemLanguageResultExecution timeMemory
1177920ezzzaySeparator (CEOI19_separator)C++20
100 / 100
330 ms23108 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define ff first #define ss second #define pb push_back const int N=2e6+5; const int P=1e9; vector<int>ans; signed main(){ int n; cin>>n; int s=0; priority_queue<int>q; int mx=0; for(int i=1;i<=n;i++){ int b; cin>>b; b=(s+b)%P; while(q.size() and q.top()>b*P+i){ q.pop(); } if(b>=mx){ q.push(b*P+i); } mx=max(mx,b); s=q.size(); ans.pb(s); } for(auto s:ans)cout<<s<<'\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...