Pagini recente » Cod sursa (job #2517601) | Cod sursa (job #1970105) | Cod sursa (job #1081935) | Cod sursa (job #282108) | Cod sursa (job #825292)
Cod sursa(job #825292)
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream o("scmax.out");
int best[100003],a[100003], maxi,sol=0,poz[100003],p;
int n;
void read()
{
f>>n;
for(int i=1;i<=n;++i) f>>a[i];
}
void dinamic()
{
int i,j;
best[n]=1;
poz[n]=-1;
maxi=1; p=n;
for(i=n-1;i>=1;--i)
{
best[i]=1;
poz[i]=-1;
for(j=i+1;j<=n;++j)
if(a[i]<a[j] && best[i]<best[j]+1)
{
best[i]=best[j]+1;
poz[i]=j;
if(best[i]>maxi) maxi=best[i],p=i;
}
}
}
void constr()
{
int i;
i=p;
while(i!=-1)
{
o<<a[i]<<' ';
i=poz[i];
}
}
int main()
{
read();
dinamic();
o<<maxi<<endl;
constr();
return 0;
}