Pagini recente » Cod sursa (job #837959) | Cod sursa (job #650268) | Cod sursa (job #317052) | Cod sursa (job #2626937) | Cod sursa (job #779401)
Cod sursa(job #779401)
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,best[100003] , a[100003] , mx , poz[100003],p;
void solve()
{
int i , j;
best[n]=1;
poz[n]=-1;
mx=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]>mx) mx=best[i],p=i;
}
}
}
void solutie()
{
int i;
i=p;
while(i!=-1)
{
g<<a[i]<<" ";
i=poz[i];
}
}
int main()
{
f>>n;
for(int i=1; i<=n; i++) f>>a[i];
solve();
g<<mx<<endl;
solutie();
return 0;
}