Pagini recente » Cod sursa (job #2076763) | oji-10-2 | Cod sursa (job #1355263) | Cod sursa (job #2685019) | Cod sursa (job #2113996)
#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=-20000000, maxL=-20000000;
fin>>n;
for (i=1;i<=n;i++)
{
fin>>v[i];
}
for(i=1;i<=n;++i)
{
if (i==1)
L[i]=1;
else
{
for(j=1;j<=i-1;++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;
}