Pagini recente » Cod sursa (job #779408) | Cod sursa (job #1181703) | Cod sursa (job #1741558) | Cod sursa (job #1417349) | Cod sursa (job #2239161)
/* Then, everything changed when the Fire Nation attacked. */
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define mod 1000000007
#define fi first
#define se second
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, v[100002];
int len[100002], arr[100002];
int mx, wh;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// shuffle(permutation.begin(), permutation.end(), rng);
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
len[1]=1;
mx=1, wh=1;
arr[1] = v[1];
for(int i=2;i<=n;++i)
{
if(v[i] > arr[mx])
{
++mx;
wh = i;
len[i]=mx;
arr[mx]=v[i];
continue;
}
int b = 1;
int e = mx;
while(b<=e)
{
int mid = (b+e)/2;
if(v[i]<=arr[mid] && v[i]>arr[mid-1])
{
arr[mid]=v[i];
len[i]=mid;
break;
}
if(v[i]<=arr[mid])
b = mid + 1;
else
e = mid - 1;
}
}
g<<mx<<'\n';
vector<int>sol;
int prev=2000000001;
for(int i=wh;i>=1;--i)
if(len[i]==mx && v[i]<prev)
{
sol.push_back(v[i]);
prev=v[i];
--mx;
}
reverse(sol.begin(), sol.end());
for(int i=0;i<sol.size();++i)
g<<sol[i]<<" ";
return 0;
}