Cod sursa(job #3158809)

Utilizator leelcheeseCiovnicu Denis leelcheese Data 19 octombrie 2023 20:48:15
Problema Subsir crescator maximal Scor 55
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.92 kb
#include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define ll long long 
#define ull unsigned long long 
#define nmax 100006
#define MOD 9901 
#define INF 2123456789
//#define fin cin 
//#define fout cout 

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n;
int a[nmax];
int dp[nmax], len;
int urm[nmax];

void CB(int x)
{
	if (dp[1] > x)
	{
		dp[1] = x;
		return;
	}
	if (dp[len] < x)
	{
		dp[++len] = x;
		return;
	}
	int st, dr, m, p;
	st = 1; dr = len; p = n + 1;
	while (st <= dr)
	{
		m = (st + dr) / 2;
		if (dp[m] > x)
		{
			p = m;
			dr = m - 1;
		}
		else
			st = m + 1;
	}
	dp[p] = x;
}

int main()
{
	int i;
	fin >> n;
	for (i = 1; i <= n; i++)
		fin >> a[i];
	for (i = 1; i <= n; i++)
		CB(a[i]);
	fout << len << "\n";
	for (i = 1; i <= len; i++)
		fout << dp[i] << " ";
	fout << "\n";
	fin.close();
	fout.close();
	return 0;
}