제출 #635562

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
635562		ColourAttila	Global Warming (CEOI18_glo)	C++17	0 / 100	114 ms	3412 KiB

glo

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

const int INF = 1e9;

int main() {
	int n,x;
    cin >>n >> x;

    vector<int> v(n);
    for(int&i : v) cin >> i;


    vector<int> suf(n+1, 0), lds(n+1, -1);
    lds[0] = INF;
    for(int i = n-1; i >= 0; i--) {
        int l = 0, r = n, mo = n;
        while(l <= r) {
            int mid = (l + r) / 2;
            if(lds[mid] >= v[i]) {
                l = mid+1;
                mo = mid;
            }
            else r = mid-1;
        }
        //cout << i << ": " << mo << endl;
        mo++;
        suf[i] = mo;
        lds[mo] = v[i];
    }

    /*for(int i = 0; i < n; i++) cout << suf[i] << ' ';
    cout << endl;*/
    vector<int> dp(n+1, INF);
    dp[0] = -1;
    int mo = 0;
    for(int i = 0; i < n; i++) {
        int a = lower_bound(dp.begin(), dp.end(), v[i] + x) - dp.begin();
        /*cout << i << ": ";
        for(int i = 0; i <= n; i++) cout << dp[i] << ' ';
        cout << endl << a << ", " << suf[i] << endl;*/
        mo = max(mo, a-1 + suf[i]);

        int j = lower_bound(dp.begin(), dp.end(), v[i]) - dp.begin();
        dp[j] = v[i];
    }
    cout << mo;
}

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