Submission #660789

#	Time	Username	Problem	Language	Result	Execution time	Memory
660789		mychecksedad	Radio Towers (IOI22_towers)	C++17	15 / 100	901 ms	1488 KiB

towers

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100, K = 20;

bool case2 = 1;
int k, dp[N], n;
vector<int> A;
void init(int NN, std::vector<int> a){
	n = NN;
	if(n > 2000) case2 = 0;
	k = max_element(a.begin(), a.end()) - a.begin();
	A = a;
}

int max_towers(int L, int R, int D){
	if(!case2){
		if(R <= k || L >= k) return 1;
		if(A[L] <= A[k] - D && A[R] <= A[k] - D) return 2;
		return 1;
	}
	for(int i = 0; i < n; ++i) dp[i] = 1;
	for(int i = L + 2; i <= R; ++i){
		int mx = A[i - 1];
		for(int j = i - 2; j >= L; --j){
			if(mx - D >= A[i] && mx - D >= A[j]) dp[i] = max(dp[i], dp[j] + 1);
			mx = max(mx, A[j]);
		}
	}
	return *max_element(dp + L, dp + R + 1);
}

• Subtask 1: 4 / 4
• Subtask 2: 11 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 14
• Subtask 5: 0 / 17
• Subtask 6: 0 / 19
• Subtask 7: 0 / 23