| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1177902 | ezzzay | Separator (CEOI19_separator) | C++20 | 1295 ms | 456 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=3e5+5;
const int P=1e9;
int a[N];
vector<int>ans;
signed main(){
int n;
cin>>n;
int s=0;
for(int i=1;i<=n;i++){
int b;
cin>>b;
a[i]=(s+b)%P;
int t=0;
for(int j=1;j<=i;j++){
bool u=1;
for(int k=1;k<=i;k++){
if(j==k)continue;
if(k>j and a[k]<a[j])u=0;
if(j>k and a[k]>a[j])u=0;
}
t+=u;
}
s=t;
ans.pb(s);
}
for(auto s:ans)cout<<s<<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... | ||||
