Pagini recente » Cod sursa (job #1934315) | Cod sursa (job #1953502) | Cod sursa (job #2708675) | Cod sursa (job #1522000) | Cod sursa (job #2076982)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int a[10000], pre[10000], b[10000], n;
void drum()
{
for(int i=n ; i>1; i--)
if(i==n)
{
b[i]=1;
pre[i]=0;
}
else
for(int j=i+1; j<=n; j++)
if(a[i]<a[j] && b[i]<b[j])
{
b[i]=b[j]+1;
pre[i]=j;
}
}
void citire()
{
f>>n;
int i=0;
while(f>>a[++i]);
}
int maxim()
{
int maxim=0,poz;
for(int i=1; i<=n; i++)
if(maxim<b[i])
{
maxim=b[i];
poz=i;
}
return poz;
}
void afisare(int k)
{
if(k!=0)
{
g<<a[k]<<" ";
afisare(pre[k]);
}
}
int main()
{
citire();
drum();
int lmax;
lmax=maxim();
g<<b[lmax]<<"\n";
afisare(lmax);
}