Pagini recente » Cod sursa (job #1591167) | Cod sursa (job #1873361) | Cod sursa (job #1848688) | Cod sursa (job #2402152) | Cod sursa (job #1013982)
#include <fstream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int stare[100003];
int a[100003]
int max,sol=0,p;
int poz[100003];
int n;
void citeste()
{
f>>n;
for(int i=1;i<=n;++i) f>>a[i];
}
void dinamic()
{
int i,j;
stare[n]=1;
poz[n]=-1;
max=1;
p=n;
for(i=n-1; i>=1; i--)
{
stare[i]=1;
poz[i]=-1;
for(j=i+1; j<=n; j++)
if(a[i]<a[j] && stare[i]<stare[j]+1)
{
stare[i]=stare[j]+1;
poz[i]=j;
if(stare[i]>max)
{
max=stare[i];
p=i;
}
}
}
}
void constr()
{
int i;
i=p;
while(i!=-1)
{
g<<a[i];
i=poz[i];
}
}
int main()
{
citeste();
dinamic();
g<<'\n'<<max);
constr();
return 0;
}