Cod sursa(job #2012192)
Utilizator | Data | 18 august 2017 11:31:56 | |
---|---|---|---|
Problema | Subsir 2 | Scor | 18 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream f("subsir2.in");
ofstream g("subsir2.out");
int n;
int v[5001];
int lmax[5001];
int sm[5001];
int main()
{
f>>n;
for(int i=1;i<=n;++i)
f>>v[i];
sm[1]=1;
for(int i=2;i<=n;++i){
for(int j=1;j<i;++j)
if(v[i]>=v[j])
sm[i]=max(sm[i],sm[j]+1);
sm[i]=max(sm[i],1);
}
int lmax=0;
for(int i=1;i<=n;++i)
lmax=max(lmax,sm[i]);
g<<lmax;
return 0;
}