제출 #969356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
969356		vjudge1	Global Warming (CEOI18_glo)	C++17	15 / 100	2054 ms	4188 KiB

glo

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

#define pii pair<int,int>

const int mxN = 2e5+5;
int n, x, arr[mxN];
pii lis[mxN], inlis[mxN];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n >> x;
    vector<int> temp;
    for(int i = 1; i <= n; ++i) {
        cin >> arr[i];
        auto itr = lower_bound(temp.begin(), temp.end(), arr[i]);
        if(itr == temp.end())
            temp.emplace_back(arr[i]);
        else
            *itr = arr[i];
        lis[i] = {temp.size(), temp[temp.size()-1]};
    }
    temp.clear();
    for(int i = n; i >= 1; --i) {
        auto itr = lower_bound(temp.begin(), temp.end(), -arr[i]);
        if(itr == temp.end())
            temp.emplace_back(-arr[i]);
        else 
            *itr = -arr[i];
        inlis[i] = {temp.size(), temp[temp.size()-1]};
        // cout << inlis[i].first << ' ' << inlis[i].second << '\n';
    }

    int ans = 0;
    
    for(int i = 1; i <= n; ++i) {
        for(int j = i+1; j <= n; ++j) {
            if(lis[i].second - x < -inlis[j].second) {
                ans = max(ans, lis[i].first + inlis[j].first);
            }
        }
    }
    cout << ans;

}

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