Cod sursa(job #1488643)
Utilizator | Data | 19 septembrie 2015 13:47:07 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
int a[100001],d[100005];
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
int i,n,j,max=-1;
f>>n;
for(i=1;i<=n;++i)
{
f>>a[i];
}
d[1]=1;
for(i=1;i<=n;++i)
{
max=0;
for(j=1;j<=i-1;++j)
if(d[j]>max && a[j]<a[i])
max=d[j];
d[i]=1+max;
}
max=-1;
for(i=1;i<=n;++i)
if(d[i]>max)
max=d[i];
g<<max;
}