Pagini recente » Cod sursa (job #1310576) | Cod sursa (job #2675604) | Cod sursa (job #2165877) | Cod sursa (job #1030426) | Cod sursa (job #1502397)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int i,n,a[100000],best[1000000],poz[100000],j,b[100000],p,Max;
void dinamic()
{
best[n]=1;
poz[n]=-1;
for(i=n-1;i>0;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] > Max){
Max=best[i];
p=i;
}
}
}
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
dinamic();
g<<Max<<"\n";
i=p+1;
while(p!=-1)
{
g<<a[p]<<" ";
p=poz[p];
}
return 0;
}