Submission #633522

#	Time	Username	Problem	Language	Result	Execution time	Memory
633522		Ahmed57	지구 온난화 (NOI13_gw)	C++14	19 / 40	1090 ms	65536 KiB

gw

#include <bits/stdc++.h>

using namespace std;
//BIT Fenwick tree
int n ;
int bit[6000001]={0};
void add(int e,int v){
    while(e<=n*4){
        bit[e]+=v;
        e+=e&-e;
    }
}
long long sum(int e){
    long long res = 0;
    while(e>=1){
        res+=bit[e];
        e -= e&-e;
    }
    return res;
}
int main(){
    cin>>n;
    vector<int> v,w,so;v.push_back(2);
    for(int i = 0;i<n;i++){
        int x;cin>>x;
        w.push_back(x);
        so.push_back(x);
    }
    sort(so.begin(),so.end());
    int z = 2;
    map<int,int>cmp;
    for(int i = 0;i<n;i++){
        cmp[so[i]] = z++;
        if(i&&so[i]==so[i-1])z--;
    }
    for(int i = 0;i<n;i++){
        v.push_back(cmp[w[i]]*2);
    }
    for(int i = 0;i<n;i++){
        if(v[i]<v[i+1]){
            add(v[i+1],-1);
            add(v[i],1);
        }
    }
    long long ma = 0;
    for(int i = 2;i<=cmp[so[n-1]]*2;i++){
        ma = max(ma,sum(i));
    }
    cout<<ma<<"\n";
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 7 / 7
• Subtask 4: 0 / 10
• Subtask 5: 0 / 11