제출 #779485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
779485		OrazB	Global Warming (CEOI18_glo)	C++14	0 / 100	18 ms	3492 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 200005
#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


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

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];
	assert(x);
	vector<int> lft(n+1, 0), rgt(n+1, 0);
	for (int i = 1; i <= n; i++) a[i] -= x;
	LIS(n, a, lft);
	for (int i = 1; i <= n; i++) a[i] += x, a[i] = -a[i];
	reverse(a.begin()+1, a.end());
	LIS(n, a, rgt);
	int mx = 0;
	for (int i = 1; i <= n; i++) mx = max(mx, lft[i]+rgt[i]-1);
	cout << mx;
}	

컴파일 시 표준 에러 (stderr) 메시지

glo.cpp: In function 'void LIS(int, std::vector<int>, std::vector<int>&)':
glo.cpp:30:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   if (pos == vec.size()) vec.pb(a[i]);
      |       ~~~~^~~~~~~~~~~~~

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