| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1346869 | jenterjongle45 | 지구 온난화 (NOI13_gw) | C++20 | 135 ms | 8268 KiB |
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
const int N=1000100;
bitset<N> ch;
int main(){
cin.tie(0)->sync_with_stdio(0);
int n,now=0,mx=1,j=n-1;cin>>n;
vector<pii> a(n);
for(int i=0;i<n;i++){
cin>>a[i].first;
a[i].second=i;
}
sort(a.begin(),a.end());
for(int i=n-1;i>=0;i--){
int tmp=a[i].first;
while(i>=0&&a[i].first==tmp){
int x=a[i].second;
ch[x]=1;
if((x==0||ch[x-1]==0)&&(x==n-1||ch[x+1]==0)) now++;
else if((x!=0&&ch[x-1]==1)&&(x!=n-1&&ch[x+1]==1)) now--;
i--;
}
mx=max(mx,now);
i++;
}
cout<<mx;
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
