Pagini recente » Cod sursa (job #3228064) | Cod sursa (job #803464) | Cod sursa (job #1663863) | Cod sursa (job #2279639) | Cod sursa (job #1376540)
/*
Those without power, seek us!
Those with power, fear us!
We are the Order of the Black Knights!
*/
#include<fstream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define FITP(a,b) for(vector<pair<unsigned int,int> >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<ctime>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<set>
#define f cin
#define g cout
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned int
#define mod 1000000009LL
#define SQR 350
#define inf 1<<30
#define div fdasfasd
#define hash dsafdsfds
#define od 100003
#define mod 4398042316799LL
#define DIM 60010000
#define base 256
#define bas 255
#define N 100100
using namespace std;
/*
int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};
*/
ifstream f("scmax.in");
ofstream g("scmax.out");
int sol[N],s[N],v[N],L[N],t,n,ts,p,tt;
int cb(int x)
{
int st=1,dr=t;
while(st<=dr)
{
int mij=(st+dr)>>1;
if(s[mij]>=x)
dr=mij-1;
else
st=mij+1;
}
return dr+1;
}
int main ()
{
f>>n;
FOR(i,1,n)
{
f>>v[i];
if(!t||v[i]>s[t])
{
s[++t]=v[i];
L[i]=t;
}
else
{
s[cb(v[i])]=v[i];
L[i]=cb(v[i]);
}
if(t>tt)
{
tt=t;
p=i;
}
}
g<<tt<<"\n";
while(tt--)
{
sol[++ts]=v[p];
while(1)
{
--p;
if(L[p]==tt&&v[p]<sol[ts])
break;
}
}
ROF(i,ts,1)
g<<sol[i]<<" ";
return 0;
}