oj.uz

답안 #284368

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
284368 2020-08-27T09:38:30 Z Revo7 Global Warming (CEOI18_glo) C++14
27 / 100
 828 ms 16248 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define left 2*i+1
#define righ 2*i+2
#define mid (l+r)/2
#define IOS ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);


using namespace std;
const ll maxn=2e5+100;
const ll inf=1e9+10;
const ll mod=1e9+7;
const ll base=27;

int n,k,ans;
int a[maxn],st[4*maxn],pre[maxn],suf[maxn];
map<int,int>ha;

int qur(int i,int l,int r,int ql,int qr){
    if(ql>qr)return 0;
    if(r<ql||l>qr)return 0;
    if(l>=ql&&r<=qr)return st[i];
    return max(qur(left,l,mid,ql,qr),qur(righ,mid+1,r,ql,qr));
}

void upd(int i,int l,int r,int id,int val){
    if(r<id||l>id)return;
    if(l==r){
        st[i]=max(st[i],val);
        return;
    }
    upd(left,l,mid,id,val);
    upd(righ,mid+1,r,id,val);
    st[i]=max(st[left],st[righ]);
}

void clear(int i,int l,int r){
    if(l==r){
        st[i]=0;
        return;
    }
    clear(left,l,mid);
    clear(righ,mid+1,r);
    st[i]=0;
}

int main()
{
    cin>>n>>k;
    for(int i=0;i<n;i++){
        cin>>a[i];
        ha[a[i]]=1;
    }
    ha[k]=1;
    int cnt=0;
    for(auto &x:ha){
        x.second=cnt++;
    }
    k=ha[k];
    for(int i=0;i<n;i++){
        a[i]=ha[a[i]];
        pre[i]=1+qur(0,0,cnt-1,0,a[i]-1);
        upd(0,0,cnt-1,a[i],pre[i]);
        ans=max(ans,pre[i]);
    }
    //for(int i=0;i<n;i++)cout<<pre[i]<<' ';cout<<endl;

    clear(0,0,cnt-1);
    for(int i=n-1;i>=0;i--){
        suf[i]=1+qur(0,0,cnt-1,a[i]+1,cnt-1);
        upd(0,0,cnt-1,a[i],suf[i]);
        if(i){
            int cur=pre[i-1]+qur(0,0,cnt-1,max(0,a[i-1]-k+1),cnt-1);
            ans=max(ans,cur);
            //if(cur==6)cout<<i<<endl;
        }
    }

    //for(int i=0;i<n;i++)cout<<suf[i]<<' ';cout<<endl;
    cout<<ans<<endl;
    return 0;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 0 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 0 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 0 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 828 ms 16128 KB Output is correct
2 Correct 783 ms 15992 KB Output is correct
3 Correct 764 ms 16012 KB Output is correct
4 Correct 712 ms 16204 KB Output is correct
5 Correct 345 ms 9576 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 4216 KB Output is correct
2 Correct 129 ms 4348 KB Output is correct
3 Correct 133 ms 4228 KB Output is correct
4 Correct 77 ms 2680 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Incorrect 80 ms 2680 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 318 ms 8248 KB Output is correct
2 Correct 322 ms 8256 KB Output is correct
3 Correct 688 ms 16248 KB Output is correct
4 Correct 307 ms 9544 KB Output is correct
5 Correct 172 ms 7928 KB Output is correct
6 Correct 341 ms 14712 KB Output is correct
7 Correct 401 ms 15480 KB Output is correct
8 Correct 232 ms 8204 KB Output is correct

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Incorrect 0 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -