Cod sursa(job #2039208)
Utilizator | Data | 14 octombrie 2017 12:46:47 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
using namespace std;
int a[100],v[100],n,maxi,rez;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
{
maxi=0;
for(int j=i;j>0;j--)
{if(maxi<v[j]&&a[j]<a[i])
maxi=v[j];
}
v[i]=maxi+1;
if(v[i]>rez)
rez=v[i];
}
cout<<rez;
return 0;
}