oj.uz

Submission #984567

# Submission time Handle Problem Language Result Execution time Memory
984567 2024-05-16T18:53:53 Z Acanikolic Global Warming (CEOI18_glo) C++14
10 / 100
 50 ms 7376 KB 
#include <bits/stdc++.h>

#define int long long

#define pb push_back

#define F first

#define S second

const int N = 500 + 10;

const int inf = 2e9;

const int mod = 998244353;

using namespace std;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

	int n,x,res = 0;
	cin >> n >> x;
	vector<int>a(n);
	for(int i = 0; i < n; i++) {
		cin >> a[i];
		a[i] -= x;
	}
	vector<pair<int,int>>pref(n);
	vector<int>v;
	for(int i = 0; i < n; i++) {
		if(v.empty() || v.back() < a[i]) {
			v.pb(a[i]);
		}else {
			int lb = lower_bound(v.begin(),v.end(),a[i]) - v.begin();
			v[lb] = a[i];
		}
		pref[i] = {v.back(),v.size()};
	}
	res = pref[n - 1].S;
	for(int i = 0; i < n; i++) {
		a[i] += x;
		a[i] *= -1;
	}
	vector<int>vec;
	for(int i = n - 1; i > 0; i--) {
		if(vec.empty() || vec.back() < a[i]) {
			vec.pb(a[i]);
		}else {
			int lb = lower_bound(vec.begin(),vec.end(),a[i]) - vec.begin();
			vec[lb] = a[i];
		}
		int l = 0,r = i - 1,ans = -1;
		while(l <= r) {
			int mid = (l + r) / 2;
			if(pref[mid].F < vec.back()) {
				ans = mid;
				l = mid + 1;
			}else {
				r = mid - 1;
			}
		}
		res = max(res,(int)vec.size() + (ans != -1 ? pref[ans].S : 0));
	}
	cout << res;
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 5104 KB Output is correct
2 Correct 50 ms 4956 KB Output is correct
3 Correct 40 ms 4952 KB Output is correct
4 Correct 38 ms 5196 KB Output is correct
5 Correct 19 ms 7376 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1628 KB Output is correct
2 Correct 9 ms 1656 KB Output is correct
3 Correct 9 ms 1624 KB Output is correct
4 Incorrect 6 ms 2136 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2820 KB Output is correct
2 Incorrect 21 ms 3796 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -