Pagini recente » Cod sursa (job #2782077) | Cod sursa (job #2703104) | Cod sursa (job #682450) | Cod sursa (job #1436202) | Cod sursa (job #1502401)
#include <bits/stdc++.h>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int v[1000],best[1000],poz[100],b[1000],p;
int main()
{
int n,i,nr=0,j;
f >> n ;
for(i = 1; i <= n; i++)
{
f >> v[i];
}
best[n]= 1;
poz[n] = -1;
for(i = n - 1; i >= 1; i--)
{
for( j = i+1; j <= n; j++)
{
if(v[i] < v[j]&& best[i] < best[j] + 1)
{
best[i] = best[j] + 1;
poz[i] = j ;
p = i ;
}
}
}
g<<best[p]<<endl;
while(p!=-1)
{
g<<v[p]<<" ";
p=poz[p];
}
return 0;
}