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>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9;
ll n,ss,a,ma;
set <ll> s;
int main()
{
   fast
   cin>>n;
   for (int i=0;i<n;i++)
   {
       ll b;
       cin>>b;
       a=b+ss;
       a%=MOD;
       while (s.size())
       {
           ll sth=*s.rbegin();
           if (sth>a)
            s.erase(sth);
           else break;
       }
       ma=max(ma,a);
       if (ma==a)
        s.insert(a);
       ss=s.size();
       cout <<ss<<"\n";
   }
   // use scanf not cin
   return 0;
}
| # | 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... |