Submission #136221

#	Time	Username	Problem	Language	Result	Execution time	Memory
136221		SOIVIEONE	Global Warming (CEOI18_glo)	C++14	17 / 100	179 ms	8256 KiB

glo

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 222222;
ll a[N], l[N], sz[N], la[N], d[N];
int main()
{
	ll n, x;
	cin >> n >> x;
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	int lis = 0;
	for(int i = 1; i <= n; i ++)
	{
		int id = lower_bound(l, l + lis, a[i]) - l;
		l[id] = a[i];
		if(id == lis)
			lis ++;
		sz[i] = lis;
		la[i] = l[lis-1];
	}
	int lds = 0, ans = 0;
	for(int i = n; i >= 1; i --)
	{
		int id = lower_bound(d, d + lds, -a[i]) - d; 
		d[id] = -a[i];
		if(id == lds)
				lds ++;
		if(a[i] + x > la[i - 1])
		{
			ans = max(ans, (int)(sz[i - 1] + lds));
		}
	}	
	cout << ans;
}

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