Cod sursa(job #1111968)
Utilizator | Data | 19 februarie 2014 12:09:32 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
long v[100010];
int n,l[100010],m;
int main()
{
f>>n;
for(int i=1;i<=n;++i) f>>v[i];
for(int i=1;i<=n;++i)
{
//if(l[i]==0) l[i]++;
for(int j=i+1;j<=n;++j)
{
if(v[i]<v[j]) l[i]++;
}
}
m=-1;
for(int k=1;k<=n;k++) m=max(m,l[k]);
g<<m<<'\n';
}