제출 #358637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
358637		sumit_kk10	Global Warming (CEOI18_glo)	C++14	10 / 100	56 ms	3180 KiB

glo

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;


int main(){
    fast;
    long long int n, x;
    cin >> n >> x;
    vector<int> a(n);
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    int left_dp[n + 1], right_dp[n + 1];
    vector<int> lis;
    left_dp[0] = 1;
    lis.push_back(a[0]);
    for(int i = 1; i < n; ++i){
        if(a[i] > lis.back()){
            lis.push_back(a[i]);
            left_dp[i] = lis.size();
        }
        else{
            int low = 0, high = lis.size() - 1, ans = -1;
            while(low <= high){
                int mid = (low + high) / 2;
                if(lis[mid] >= a[i]){
                    ans = mid;
                    high = mid - 1;
                }
                else
                    low = mid + 1;
            }
            if(ans != -1)
                lis[ans] = a[i];
            left_dp[i] = ans + 1;
        }
    }
    right_dp[n - 1] = 1;
    lis.clear();
    lis.push_back(a[n - 1]);
    for(int i = n - 2; i >= 0; --i){
        if(a[i] - x < lis.back())
            right_dp[i] = lis.size() + 1;
        if(a[i] < lis.back())
            lis.push_back(a[i]);
        else{
            int low = 0, ans = -1, high = lis.size();
            while(low <= high){
                int mid = (low + high) / 2;
                if(lis[mid] <= a[i] - x){
                    ans = mid;
                    high = mid - 1;
                }
                else
                    low = mid + 1; 
            }
            right_dp[i] = ans + 1;
            low = 0, ans = -1, high = lis.size();
            while(low <= high){
                int mid = (low + high) / 2;
                if(lis[mid] <= a[i]){
                    ans = mid;
                    high = mid - 1;
                }
                else
                    low = mid + 1; 
            }
            if(ans != -1)
                lis[ans] = a[i];
        }
    } 
    int mx = 0;
    for(int i = 0; i < n; ++i)
        mx = max(mx, left_dp[i] + right_dp[i] - 1);
    cout << mx << '\n';
    return 0;
}

• 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