Cod sursa(job #2246870)
Utilizator | Data | 27 septembrie 2018 17:29:31 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int d[100001],a[100001],n;
vector <int>v;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{f>>a[i];
d[i]=1;
}
int m=0;
for(int k=1;k<=n;k++)
{ m=max(m,d[k]);
for(int j=k+1;j<=n;j++)
if(a[k]<a[j])
d[j]=d[k]+1;
}
g<<m;
return 0;
}