제출 #1218763

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218763		muhammadali_2009	Global Warming (CEOI18_glo)	C++20	10 / 100	22 ms	4544 KiB

glo

//              +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+     //          

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define endl '\n'
#define ll long long
#define int long long
#define all(x) x.begin(), x.end()
#define all1(x) x.rbegin(), x.rend()
#define seea(x) for(int i = 0; i < x; i++)
#define pb push_back
#define ff first
#define vc vector
#define ss second

using namespace std;  
const int mod = 1e9 + 7;

int lis(vector<int>a){
    int n = a.size();
    vector<int>dp;
    for(int i = 0; i < n; i ++){
        auto id = lower_bound(dp.begin(), dp.end(), a[i]);
        if(id == dp.end()){
            dp.push_back(a[i]);
        }
        else dp[id - dp.begin()] = a[i];
    }
    return dp.size();
}

void solve() {
    int ans = 1;
    int n, x; cin >> n >> x;
    vector<int>a(n), dp;
    seea(n) cin >> a[i];
    if(x == 0){
        cout << lis(a) << endl;
        return;
    }
    //pref[i] -> i-indeksgacha va i ni olgandagi lis
    //suf[i] -> 1 .. i - indeks -x qilingandagi va i - indexdan n - gacha lis
    vector<int>pref(n + 1), suff(n + 2);
    for(int i = 1; i <= n; i ++){
        auto id = lower_bound(dp.begin(), dp.end(), a[i - 1]);
        if(id == dp.end()){
            dp.push_back(a[i - 1]);
        }
        else{
            dp[id - dp.begin()] = a[i - 1];
        }
        pref[i] = dp.size();
        ans = max(ans, pref[i]);
    }
    //cout << ans << endl;
    dp.clear();
    for(int i = 1; i <= n; i ++){
        a[n - i] *= -1;
        auto id = lower_bound(dp.begin(), dp.end(), a[n - i]);
        if(id == dp.end()){
            dp.push_back(a[n - i]);
        }
        else{
            dp[id - dp.begin()] = a[n - i];
        }
        suff[n - i + 1] = dp.size();
        ans = max(ans, suff[n - i + 1] + pref[i] - 1);
    }
    cout << ans << endl;
}

signed main(){
    fast;
    int t = 1;
    //cin >> t;
    while (t--){
        solve();
    }
}

• Subtask 1: 0 / 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