Submission #1198475

#	Time	Username	Problem	Language	Result	Execution time	Memory
1198475		PlayVoltz	Global Warming (CEOI18_glo)	C++20	100 / 100	77 ms	4692 KiB

glo

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	int n, k, ans=0;
	cin>>n>>k;
	vector<int> vect(n), lis, right(n);
	for (int i=0; i<n; ++i)cin>>vect[i];
	for (int i=n-1; i>=0; --i){
		if (lis.empty()||lis.back()<-vect[i])lis.pb(-vect[i]);
		else *lower_bound(lis.begin(), lis.end(), -vect[i])=-vect[i];
		right[i]=(upper_bound(lis.begin(), lis.end(), -vect[i])-lis.begin());
	}
	lis.clear();
	for (int i=0; i<n-1; ++i){
		if (lis.empty()||lis.back()<vect[i])lis.pb(vect[i]);
		else *lower_bound(lis.begin(), lis.end(), vect[i])=vect[i];
		ans=max(ans, lower_bound(lis.begin(), lis.end(), vect[i+1]+k)-lis.begin()+right[i+1]);
	}
	cout<<ans;
}

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