Pagini recente » Cod sursa (job #238027) | Cod sursa (job #2190590) | Cod sursa (job #2863358) | Cod sursa (job #812231) | Cod sursa (job #1356178)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int best[100005], a[100005], N, maxim, poz[100005], prec;
int main()
{
f>>N;
for (int i=1; i<=N; ++i)
f>>a[i];
best[N]=1; a[0]=(1<<30);
for (int i=N-1; i>0; --i)
{
best[i]=1; poz[i]=-1;
for (int j=i+1; j<=N; ++j)
if (a[j]>a[i] && best[i]<best[j]+1)
{
best[i]=best[j]+1;
if (best[i]>maxim)
maxim=best[i], prec=i;
}
}
g<<maxim<<'\n'<<a[prec]<<' ';
for (int i=prec; i<=N; ++i)
if (best[prec]-1==best[i]) g<<a[i]<<' ', prec=i;
return 0;
}