Pagini recente » Cod sursa (job #975973) | Cod sursa (job #1752729) | Cod sursa (job #1608791) | Cod sursa (job #3140141) | Cod sursa (job #3281099)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
vector<int> v,D,P,I;
int main()
{
int n;
f>>n;
v.resize(n+1);
D.resize(n+1);
P.resize(n+1);
I.resize(n+1);
for(int i=1; i<=n; i++)
f>>v[i];
int k=1;
D[k] = v[1];
P[1] = k;
for(int i=2; i<=n; i++)
if(v[i] > D[k])
{
D[++k] = v[i];
P[i] = k;
}
else
{
int st =1, dr = k, poz = k + 1;
while(st<=dr)
{
int m = (st+dr)/2;
if(D[m] >= v[i])
poz = m,dr = m-1;
else
st = m+1;
}
D[poz] = v[i];
P[i] = poz;
}
g<<k<<'\n';
int j = n;
for(int i = k ; i >= 1 ; i --)
{
while(P[j] != i)
j --;
I[i] = j;
}
for(int i=1; i<=k; i++)
g<<v[I[i]]<<' ';
return 0;
}