Pagini recente » preoji_valoros | Cod sursa (job #2347390) | Cod sursa (job #1513402) | Cod sursa (job #2484195) | Cod sursa (job #1360257)
#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;
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];
L[k]=mx+1;
if(L[k]>maxx)
{
maxx=L[k];
t=k;
}
}
g<<maxx;
g<<endl<<v[t]<<' ';
for(i=t+1;i<=n;i++)
if ((v[i]>v[t]) && (L[i]==maxx-1))
{
g<<v[i]<<' ';
maxx--;
}
return 0;
}