Submission #713780

#	Time	Username	Problem	Language	Result	Execution time	Memory
713780		Hydrolyzed	Global Warming (CEOI18_glo)	C++14	28 / 100	7 ms	468 KiB

glo

/*
 * AUTHOR	: Hydrolyzed~
 * SCHOOL	: RYW
 * TASK		: Global Warming 
 * ALGO		: Dynamic Programming
 * DATE		: 23 Mar 2023
 * */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#ifndef _DEBUG
// @==== Libary ====@ //

// @================@ //
#endif

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

template <typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update> ;

// @=== Debugger ===@ //
#ifdef _DEBUG
#include "debug.hpp"
#else
#define dbg(...) 0
#endif
// @================@ //

using ll = long long;

const int MxN = 1010;
int dp[MxN], dp2[MxN], a[MxN];

inline void solution(){
	int n, x;
	cin >> n >> x;
	for(int i=1; i<=n; ++i){
		cin >> a[i];
	}
	dp[1] = 1;
	for(int i=2; i<=n; ++i){
		dp[i] = 1;
		for(int j=i-1; j>=1; --j){
			if(a[i] > a[j]){
				dp[i] = max(dp[i], dp[j] + 1);
			}
		}
	}
	dp2[n] = 1;
	for(int i=n-1; i>=1; --i){
		dp2[i] = 1;
		for(int j=i+1; j<=n; ++j){
			if(a[i] < a[j]){
				dp2[i] = max(dp2[i], dp2[j] + 1);
			}
		}
	}
	int answer = *max_element(dp + 1, dp + n + 1);
	for(int i=1; i<=n; ++i){
		for(int j=i+1; j<=n; ++j){
			if(a[i] - a[j] < x){
				answer = max(answer, dp[i] + dp2[j]);
			}
		}
	}
	cout << answer;
	return ;
}

signed main(){
	cin.tie(nullptr)->ios::sync_with_stdio(false);	
	int q = 1;
//	cin >> q;
	while(q--){
		solution();
		cout << "\n";
	}
	return 0;
}
// https://github.com/MasterIceZ/archive/tree/main/cpp-template

• 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