Cod sursa(job #1784687)
Utilizator | Data | 20 octombrie 2016 13:07:13 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int main()
{
int n,v[100001],best[100001],i,j,x,ma=0;
in>>n;
for (i=1;i<=n;i++)
in>>v[i];
for (i=1;i<=n;i++)
{
best[i]=1;
for (j=1;j<i;j++)
{
if (v[j]<v[i]&&best[j]>=best[i])
best[i]=1+best[j];
}
if (best[i]>ma) ma=best[i];
}
out<<ma;
return 0;
}