Submission #976984

#TimeUsernameProblemLanguageResultExecution timeMemory
976984batsukh2006Separator (CEOI19_separator)C++17
100 / 100
141 ms33120 KiB
#include<iostream> #include<stdio.h> #include<math.h> #include<map> #include<string> #include<algorithm> #include<vector> #include<string.h> #include<utility> #include<set> #include<cmath> #include<queue> #include<deque> #include<functional> #include<stack> #include<limits.h> #include<iomanip> #include<unordered_map> #include<numeric> #include<tuple> #include<bitset> using namespace std; #define MOD 1000000000 #define int long long #define ff first #define ss second #define endl '\n' void solve(){ int n; cin>>n; int mx=-1; stack<int> q; vector<int> res(n+1); for(int i=1; i<=n; i++){ int b; cin>>b; int a=(res[i-1]+b)%MOD; if(a>mx){ mx=a; q.push(a); } int sum=q.size(),cnt=0; while(!q.empty()&&q.top()>a){ cnt++; q.pop(); } res[i]=sum-cnt; } for(int i=1; i<=n; i++){ cout<<res[i]<<endl; } } signed main(){ // freopen("file.in", "r", stdin); // freopen("file.out", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t=1; // cin>>t; while(t--){ solve(); cout<<endl; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...