# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150667 | eri16 | Separator (CEOI19_separator) | C++20 | 1297 ms | 1172 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9;
int main(){
long long a,b,sum=1,max1=0;
cin>>a;
vector <int> v;
cin>>b;
max1=b;
v.push_back(b);
cout<<1<<endl;
for (int i=1; i<a; i++){
cin>>b;
b=(b+v.size())%MOD;
for (int j=v.size(); j>0; j--){
if (v[j-1]>b){v.pop_back();}
}
if (b>max1){v.push_back(b);max1=b;}
cout<<v.size()<<endl;
# | 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... |