Cod sursa(job #2115008)
| Utilizator | Data | 26 ianuarie 2018 10:25:47 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
int v[101], L[101], poz[101],poz1=0, n, i, j, max1=0, maxL=0;
fin>>n;
for (i=1;i<=n;i++)
{
fin>>v[i];
max1=0;
for(j=1;j<i;++j)
{
if(v[i]>v[j] && L[j]>max1)
{
max1=L[j];
poz[i]=j;
}
}
L[i]=max1+1;
if (maxL<L[i])
{
maxL=L[i];
poz1=i;
}
}
fout<<maxL;
}
