Pagini recente » Cod sursa (job #1676216) | Cod sursa (job #1294702) | Cod sursa (job #2751027) | Cod sursa (job #2785912) | Cod sursa (job #508436)
Cod sursa(job #508436)
#include <iostream>
#include <fstream>
#include <stdio.h>
using namespace std;
int main()
{
long n,i,j,a[100001],b[100001],maxx;
ifstream f ("scmax.in");
freopen("scmax.out", "w", stdout);
f>>n;
f>>a[0];b[0]=1;
for (i=1;i<n;i++)
{
f>>a[i];
if (a[i]>=a[i-1])
{
if (a[i]==a[i-1])
b[i]=b[i-1];
else
b[i]=b[i-1]+1;
}
else
{
for (j=i-2;j>-1;--j)
{
if (a[i]>a[j])
{
b[i]=b[j]+1;
break;
}
}
if (j==-1)
b[i]=1;
}
}
maxx=1;
for (i=0;i<n;i++)
if (maxx<b[i])
maxx=b[i];
printf("%d ", maxx);
}