oj.uz

Submission #284374

# Submission time Handle Problem Language Result Execution time Memory
284374 2020-08-27T09:46:22 Z Revo7 Global Warming (CEOI18_glo) C++14
17 / 100
 1139 ms 26812 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 b[maxn],a[maxn],st[8*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[a[i]-k]=1;
    }

    int cnt=0;
    for(auto &x:ha){
        x.second=cnt++;
    }

    for(int i=0;i<n;i++){
        b[i]=ha[a[i]];
        pre[i]=1+qur(0,0,cnt-1,0,b[i]-1);
        upd(0,0,cnt-1,b[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,b[i]+1,cnt-1);
        upd(0,0,cnt-1,b[i],suf[i]);
        if(i){
            int cur=pre[i-1]+qur(0,0,cnt-1,ha[a[i]-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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 0 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 0 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 0 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 916 ms 15452 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 193 ms 7320 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 479 ms 13816 KB Output is correct
2 Correct 471 ms 13816 KB Output is correct
3 Correct 1139 ms 26812 KB Output is correct
4 Correct 439 ms 15280 KB Output is correct
5 Correct 251 ms 13816 KB Output is correct
6 Correct 496 ms 25720 KB Output is correct
7 Correct 536 ms 25800 KB Output is correct
8 Correct 348 ms 13944 KB Output is correct

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Incorrect 0 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -