Pagini recente » Cod sursa (job #2526779) | Cod sursa (job #2341296) | Cod sursa (job #1368317) | Cod sursa (job #2537205) | Cod sursa (job #1360335)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long long v[100000],n,i,L[10000],maxx,mx,k,t,U[10000],r;
int main()
{ f>>n;
for(i=1;i<=n;i++) f>>v[i];
L[n]=1;
for(k=n-1;k>0;k--)
{
mx=0;
for(i=k+1;i<=n;i++)
if(v[i]>v[k] && L[i]>mx)
mx=L[i],U[k]=v[i],t=k;
L[k]=mx+1;
if(L[k]>maxx)
{
maxx=L[k];
}
}
g<<maxx<<endl;
g<<v[t]<<' ';
for(i=1;i<n;i++)
if(U[i]!=U[i+1])g<<U[i]<<' ';
return 0;
}