oj.uz

답안 #519466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
519466 2022-01-26T12:05:31 Z A_D Global Warming (CEOI18_glo) C++14
10 / 100
 417 ms 33096 KB 
#include <bits/stdc++.h>

#define int long long
#define ii pair<int,int>
#define F first
#define S second

using namespace std;
const int N=2e5+100;
int a[N];
map<int,int> mp;
set<int> st;
int seg1[4*N];
int seg2[4*N];
int b[N];
int freq[N];
int get1(int p,int s,int e,int a,int b)
{
    if(a<=s&&e<=b)return seg1[p];
    if(s>b||e<a)return 0;
    int mid=(s+e)/2;
    return max(get1(p*2,s,mid,a,b),get1(p*2+1,mid+1,e,a,b));
}
void update1(int p,int s,int e,int i,int v)
{
    if(s==e){
        seg1[p]=v;
        return;
    }
    int mid=(s+e)/2;
    if(i<=mid){
        update1(p*2,s,mid,i,v);
    }
    else{
        update1(p*2+1,mid+1,e,i,v);
    }
    seg1[p]=max(seg1[p*2],seg1[p*2+1]);
}

int get2(int p,int s,int e,int a,int b)
{
    if(a<=s&&e<=b)return seg2[p];
    if(s>b||e<a)return 0;
    int mid=(s+e)/2;
    return max(get2(p*2,s,mid,a,b),get2(p*2+1,mid+1,e,a,b));
}



void update2(int p,int s,int e,int i,int v)
{
    if(s==e){
        seg2[p]=v;
        return;
    }
    int mid=(s+e)/2;
    if(i<=mid){
        update2(p*2,s,mid,i,v);
    }
    else{
        update2(p*2+1,mid+1,e,i,v);
    }
    seg2[p]=max(seg2[p*2],seg2[p*2+1]);
}
void solve()
{
    int n,x;
    cin>>n>>x;
    for(int i=1;i<=n;i++){
        scanf("%lld",&a[i]);
        st.insert(a[i]);
    }
    int cnt=1;
    for(auto xxxx:st){
        freq[cnt]=xxxx;
        mp[xxxx]=cnt++;
    }
    for(int i=1;i<=n;i++){
        a[i]=mp[a[i]];
    }
    for(int i=1;i<=n;i++){
        int v=0;
        if(a[i]!=1){
            v=get1(1,1,n,1,a[i]-1);
        }
        b[i]=get1(1,1,n,a[i],a[i]);
        update1(1,1,n,a[i],v+1);
    }
    int ans=get1(1,1,n,1,n);
    cout<<ans<<endl;
    return;
    //   cout<<seg1[1]<<endl;
    for(int i=n;i>1;i--){
        int v=0;
        if(a[i]!=n){
            v=get2(1,1,n,a[i]+1,n);
        }
        update2(1,1,n,a[i],v+1);
        //cout<<b[i]<<" ";
        update1(1,1,n,a[i],b[i]);
        // for(int j=1;j<=n;j++)cout<<get1(1,1,n,a[j],a[j])<<" ";cout<<endl;
        int l=1,r=cnt-1,ann;
        while(l<=r){
            int mid=(l+r)/2;
            if(freq[mid]<freq[a[i]]+x){
                l=mid+1;
                ann=mid;
            }
            else{
                r=mid-1;
            }
        }
    //      cout<<get1(1,1,n,1,ann)<<" "<<get2(1,1,n,a[i],n)<<endl;
        ans=max(ans,get2(1,1,n,a[i],n)+get1(1,1,n,1,ann));
    }
//    cout<<endl;
    cout<<ans<<endl;
}
main()
{
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}

Compilation message

glo.cpp:119:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  119 | main()
      | ^~~~
glo.cpp: In function 'void solve()':
glo.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         scanf("%lld",&a[i]);
      |         ~~~~~^~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 416 ms 31056 KB Output is correct
2 Correct 399 ms 32848 KB Output is correct
3 Correct 387 ms 33096 KB Output is correct
4 Correct 417 ms 32888 KB Output is correct
5 Correct 150 ms 18384 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 7932 KB Output is correct
2 Correct 63 ms 8376 KB Output is correct
3 Correct 67 ms 8384 KB Output is correct
4 Incorrect 46 ms 4820 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 146 ms 15660 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -