Cod sursa(job #1044001)
| Utilizator | Data | 29 noiembrie 2013 09:49:12 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out")
int a[100005],n,maxx,lis[100005];
int main()
{
int i,j,k;
k=-2e9;
f>>n;
lis[n]=1;
for(i=1;i<=n;i++)
f>>a[i];
for(i=n-1;i>=1;i--)
{
maxx=0;
for(j=i+1;j<=n;j++)
if(maxx<lis[j]&&a[i]<a[j])
maxx=lis[j];
lis[i]=maxx+1;
}
for(i=1;i<=n;i++)
if(maxx<lis[i])
maxx=lis[i];
g<<maxx<<'\n';
for(i=1;i<=n;i++)
if(lis[i]==maxx&&a[i]>k)
{
g << a[i] <<" ";
k=a[i];
--maxx;
}
return 0;
}
