Pagini recente » Istoria paginii runda/cei_mici4 | Istoria paginii runda/oji2009112/clasament | Istoria paginii runda/fjj | Cod sursa (job #1294778) | Cod sursa (job #2123309)
#include <iostream>
#include <fstream>
#define DN 100001
#define MAX 2000000001
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, poz[DN], k, m, b[DN];
long long a[DN];
int caut_bin( int p, int u, int x )
{
int m;
while(p<=u)
{
m=p+(u-p)/2;
if(x<a[b[m]])
p=m+1;
else u=m-1;
}
return p;
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>a[i];
a[0]=MAX;
for(int i=n; i>=0; i--)
{
poz[i]=0;
k=caut_bin(1, m, a[i]);
if(k>m)
{
poz[i]=b[k-1];
m=k;
b[k]=i;
}
else
{
poz[i]=b[k-1];
if(a[b[k]]<=a[i])
b[k]=i;
}
}
g<<m<<'\n';
for(int i=b[m]; i>0; i=poz[i])
g<<a[i]<<" ";
return 0;
}