Submission #768893

#	Time	Username	Problem	Language	Result	Execution time	Memory
768893		1ne	Global Warming (CEOI18_glo)	C++14	27 / 100	53 ms	14772 KiB

glo

/*
*  author : Apiram                  
*  created: 29.06.2023 01:29:41
*/

#include<bits/stdc++.h>
using namespace std;

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n,x;cin>>n>>x;
	vector<long long>arr(n);
	for (int i = 0;i<n;++i){
		cin>>arr[i];
	}
	const long long inf = 1e12;
	int ans = 0;
	vector<vector<long long>>dp(n + 1,vector<long long>(2,inf));
	for (int i = 0;i<n;++i){
		int left = 0,right = n - 1;
		int pos = -1;
		while(left<=right){
			int mid = (left + right)>>1;
			if (dp[mid][0] < arr[i]){
				pos = mid;
				left = mid + 1;
			}	
			else right = mid - 1;
		}
		dp[pos + 1][0] = min(arr[i],dp[pos + 1][0]);
		ans = max(ans,pos + 2);
		left = 0,right = n - 1;
		pos = -1;
		while(left<=right){
			int mid = (left + right)>>1;
			if (dp[mid][0] < arr[i] + x){
				pos = mid;
				left = mid + 1;
			}
			else if (dp[mid][1] < arr[i]){
				pos = mid;
				left = mid + 1;
			}
			else right = mid - 1;
		}
		ans = max(pos + 2,ans);
		dp[pos + 1][1] = min(dp[pos + 1][1],arr[i]);
	}
	cout<<ans<<'\n';
	return 0;
}

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