Cod sursa(job #2242048)
Utilizator | tudor P ptudor | Data | 17 septembrie 2018 17:47:41 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int pd[100001],a[100001],n;
int main()
{int i,j;
ifstream in("scmax.in");
ofstream out("scmax.out");
in>>n;
for (i=1;i<=n;i++)
{
in>>a[i];
for (j=1;j<i;j++)
if ((a[i]>a[j])&&(pd[j]+1>pd[i]))
pd[i]=pd[j]+1;
}
out<<pd[n]+1<<"\n";
out.close();
in.close();
return 0;
}