Submission #633602

#TimeUsernameProblemLanguageResultExecution timeMemory
633602Ahmed57Global Warming (NOI13_gw)C++17
19 / 40
1078 ms62952 KiB
#include <bits/stdc++.h>

using namespace std;
int n;
int pre[2000005];
map<int,int> cmp;
int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie();
    cin>>n;
    int la = 2;
    int arr[n],so[n];
    for(int i = 0;i<n;i++){
        cin>>arr[i];
        so[i] = arr[i];
    }
    sort(so,so+n);
    long long z = 1;
    for(int i= 0;i<n;i++){
        if(i&&so[i]==so[i-1])z--;
        cmp[so[i]] = ++z;
    }
    for(int i = 0;i<n;i++){
        if(la<cmp[arr[i]]*2){
            pre[la]++;
            pre[cmp[arr[i]]*2]--;
        }
        la = cmp[arr[i]]*2;
    }
    int ma = 0;la = 0;
    for(int i = 2;i<=z*2;i++){
        la+=pre[i];
        ma = max(ma,la);
    }
    cout<<ma<<"\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...