제출 #1297378

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1297378		muhammad-mutahir	Global Warming (CEOI18_glo)	C++20	15 / 100	27 ms	6224 KiB

glo

#include <bits/stdc++.h>
using namespace std;

#define print(l) for(auto i:l) cout<<i<<" ";cout<<endl;
#define input(t,l,n) vector<t>l(n);for(int i = 0;i<n;i++)cin>>l[i];
#define int long long
#define pb push_back
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define all(l) l.begin(),l.end()
#define pii pair<int,int>
#define fi first
#define se second

const int M = 1e9+7;
const int inf = 1e18;


int bp(int x, int y, int p){
    int res = 1;
    x = x % p;
    while (y > 0) {
 
        if (y & 1)
            res = (res * x) % p;
        y = y >> 1;
        x = (x * x) % p;
    }
    return res;
}
 
int MI(int n, int p){
    return bp(n, p - 2, p);
}
int mul(int x,int y, int p){
    return x * 1ull * y % p;
}
int di(int x,int y, int p){
    return mul(x, MI(y, p), p);
}


int n , m , k , q;

void solve(int testcase_number){
    int x;
    cin>>n>>x;
    input(int,t,n);
    vector<int>L(n+1),R(n+1);
    vector<int>md;
    
    for (int i = 0; i < n; i++) {
        auto it = lower_bound(all(md),t[i]);
        int pos = it - md.begin();
        if (it == md.end()) md.push_back(t[i]);
        else *it = t[i];
        L[i] = pos + 1;
    }
    md.clear();
    for (int i = n-1; i >= 0; i--) {
            auto it = lower_bound(all(md), x-t[i]);
            int pos = it-md.begin();
            R[i] = pos + 1;
            it = lower_bound(all(md), -t[i]);
            if (it == md.end()) md.push_back(-t[i]);
            else *it = t[i];
    }
    
    
    int ans = 0;
    for(int i = 0;i<n;i++){
    	ans = max(ans,L[i]+R[i]-1);
    }
    cout<<ans<<endl;
    
    


}


signed main(){
    ios::sync_with_stdio(0);//DO NOT USE IN INTERACTIVE
    cin.tie(0), cout.tie(0);
    cout << fixed<<setprecision(9);

    int t = 1;
    // cin>>t;
    for(int i = 1;i<=t;i++){
        solve(i);
    }

}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 10 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25