Submission #1214949

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214949		nataliaa	Global Warming (CEOI18_glo)	C++20	28 / 100	2095 ms	1096 KiB

glo

#include <bits/stdc++.h>
using namespace std;
#define ll long long
void test_case() {
	int n,x;
	cin >> n>>x;

	int a[n];
	for(int i = 0; i < n; i++) {
		cin>>a[i];
	}
/*	v.push_back(a[0]);
	for(int i = 1; i < n; i++) {
		int l =0, r = v.size();
		while(l<=r) {
			int m = (l+r)/2;
			if(v[m]>=a[i]) {
				r= m-1;
			}
			else {
				l = m+1;
			}
		}
		if(l>=v.size()) v.push_back(a[i]);
		else v[l] = a[i];
	}
	cout << v.size();*/
	int ans = 0;
		for(int i = 0; i < n; i++) {
			for(int j = 0; j<=i; j++) {
				a[j]-=x;
			}
			vector<int> v;
			v.push_back(a[0]);
			for(int i1 = 1; i1 < n; i1++) {
				int l =0, r = v.size();
				while(l<=r) {
					int m = (l+r)/2;
					if(v[m]>=a[i1]) {
						r= m-1;
					}
					else {
						l = m+1;
					}
				}
				if(l>=v.size()) v.push_back(a[i1]);
				else v[l] = a[i1];
			}
			ans = max(ans, (int)(v.size()));
			for(int j = 0; j<=i; j++) {
				a[j]+=x;
			}
		}
	cout << ans;
}

int main() {
	int t;
	t=1;
	while (t--) test_case();
}

• 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