Submission #432923

#	Time	Username	Problem	Language	Result	Execution time	Memory
432923		lukadupli	Global Warming (CEOI18_glo)	C++14	28 / 100	2091 ms	1188 KiB

glo

#include <bits/stdc++.h>

using namespace std;

const int MAX = 2e5 + 5;

int n, x, arr[MAX];

int memo[MAX][2];
int rek(int pos, bool drop){
    if(pos == 0) return 1;
    if(memo[pos][drop] > 0) return memo[pos][drop];

    int maxi = 0;
    for(int i = 0; i < pos; i++){
        if(arr[pos] > arr[i]) maxi = max(maxi, rek(i, drop));
        if(arr[i] - arr[pos] < x && drop) maxi = max(maxi, rek(i, 0));
    }

    return memo[pos][drop] = maxi + 1;
}

int main()
{
    cin >> n >> x;
    for(int i = 0; i < n; i++) cin >> arr[i];

    int maxi = 0;
    for(int i = 0; i < n; i++) maxi = max(maxi, rek(i, 1));
    cout << maxi;

    /*for(int i = 0; i < n; i++){
        printf("%d\n    drop left: %d\n    no drop left: %d\n", i, rek(i, 1), rek(i, 0));
    }*/
    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