Cod sursa(job #590415)
| Utilizator | Data | 17 mai 2011 12:21:31 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[100003],i,j,ma=int(-2e9),L[100003];
void dinamic()
{L[n]=1;
for(i=n-1;i>=1;--i)
{L[i]=1;
for(j=i+1;j<=n;j++)
if(v[i]<=v[j]&&L[i]<=L[j])
L[i]=L[j]+1;
}
}
void cauta_solutie()
{for(i=1;i<=n;i++)
if(L[i]>ma) ma=L[i];
}
int main()
{ f>>n;
for(i=1;i<=n;i++)
f>>v[i];
dinamic(); cauta_solutie();
g<<ma;
return 0;
}
