Mai intai trebuie sa te autentifici.
Cod sursa(job #1401331)
Utilizator | Data | 25 martie 2015 19:54:57 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int main()
{
int n;
in>>n;
int v[n+1];
for(int i=1; i<=n; i++)
in>>v[i];
int d[n+1];
d[n]=1;
int mx=1;
for(int i=n-1;i>=1;i--)
{
d[i]=1;
for(int j=i+1;j<=n;j++)
if(v[i]<v[j] && d[i]<d[j]+1)
{
d[i]=d[j]+1;
if(mx<d[i])
mx=d[i];
}
}
out<<mx;
return 0;
}