Submission #779414

#	Time	Username	Problem	Language	Result	Execution time	Memory
779414		OrazB	Global Warming (CEOI18_glo)	C++17	38 / 100	2057 ms	3668 KiB

glo

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

int LIS(int n, vector<int> a){
	vector<int> vec;
	vec.pb(a[1]);
	for (int i = 2; i <= n; i++){
		if (vec.back() < a[i]) vec.pb(a[i]);
		else{
			int pos = lower_bound(all(vec), a[i])-vec.begin();
			vec[pos] = min(vec[pos], a[i]);			
		}
	}
	return vec.size();
}

int main ()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, x;
	cin >> n >> x;
	vector<int> a(n+1);
	for (int i = 1; i <= n; i++) cin >> a[i];
	if (!x) return cout << LIS(n, a), 0;
	assert(x);
	int mx = 0;
	for (int i = 1; i <= n; i++){
		a[i] -= x;
		mx = max(mx, LIS(n, a));
	}
	cout << mx;
}	

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