Submission #639779

#	Time	Username	Problem	Language	Result	Execution time	Memory
639779		a_aguilo	Global Warming (CEOI18_glo)	C++14	28 / 100	2084 ms	4548 KiB

glo

#include<bits/stdc++.h>

using namespace std;

int n, x;

int main(){
    cin >> n >> x;
    int V[n];
    int dp[n][2];
    for(int i = 0; i < n; ++i) cin >> V[i];
    for(int i = 0; i < n; ++i){
        dp[i][0] = dp[i][1] = 1;
    }
    int ans = 1;
    for(int i = 1; i < n; ++i){
        for(int j = 0; j < i; ++j){
            if(V[j] < V[i]){
                dp[i][0] = max(dp[i][0], dp[j][0]+1);
                dp[i][1] = max(dp[i][1], dp[j][1]+1);
                ans = max(ans, dp[i][0]);
                ans = max(ans, dp[i][1]);
            }
            if(V[j]-x < V[i]){
                dp[i][1] = max(dp[i][1], dp[j][0]+1);
                ans = max(ans, dp[i][1]);
            }
        }
    }
    cout << ans << endl;
    return 0;
}

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