Pagini recente » Cod sursa (job #3212815) | Cod sursa (job #3219612) | Cod sursa (job #1105295) | Cod sursa (job #2277505) | Cod sursa (job #1548274)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int i,j,n,v[100001],l[100001],k,x, lmax,y,m;
int main() {
fin>>n;
for(i=1; i<=n; i++) {
fin>>v[i];
}
l[n]=1;
for (j = n - 1; j>=1; j--) {
lmax = 0;
for (i = j + 1; i <= n; i++)
if (v[j] < v[i])
if (lmax < l[i])
lmax = l[i];
l[j] = lmax + 1;
}
for(i=1; i<=n; i++)
if(l[i]>m) {
m=l[i];
x=i;
}
fout<<m<<'\n';
m--;
fout<<v[x]<<" ";
y=v[x];
for(i=x+1; m>=1; i++) {
if(l[i]==m) {
if(v[i]>y) y=v[i];
fout<<v[i]<<" ";
m--;
}
}
return 0;
}
/*
4 4 3 2 1
// 75 5 16 15 69 40 16 19 48 43 33 79 88 90
j
*/