Pagini recente » Cod sursa (job #2380715) | Cod sursa (job #2408660) | Cod sursa (job #2558595) | Cod sursa (job #1889516) | Cod sursa (job #1060763)
#include <fstream>
using namespace std;
int a[100001],l[100001],i,j,n,lmax,Max,x;
int main ()
{ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
for (i=1; i<=n; i++)
f>>a[i];
for (i=n; i>=1; i--){
lmax=0;
for (j=i+1; j<=n; j++)
if (a[j]>a[i] && lmax<l[j]) lmax=l[j];
l[i]=1+lmax;
if (l[i]>Max){ Max=l[i]; x=i;}
}
g<<Max<<'\n';
g<<a[x]<<" ";
Max--;
int ult;
ult=a[x];
for (i=x+1; i<=n; i++) {
if (l[i]==Max && a[i]>ult) {g<<a[i]<<" "; Max--; ult=a[i];}
}
return 0;
}