Cod sursa(job #1574644)
| Utilizator | Data | 20 ianuarie 2016 19:00:07 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.75 kb |
#include <fstream>
using namespace std;
ifstream fin ("scmax.in");
ofstream fout("scmax.out");
int best[100003],a[100003], maxi,sol=0,poz[100003],p,n,i,j;
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
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;
}
}
fout<<maxi<<'\n';
i=p;
while(i!=-1)
{
fout<<a[i]<<" ";
i=poz[i];
}
return 0;
}
