Pagini recente » Cod sursa (job #2892831) | Cod sursa (job #1815204) | Cod sursa (job #2805315) | Cod sursa (job #2072204) | Cod sursa (job #1704130)
#include <iostream>
#include <fstream>
using namespace std;
long long v,u[100001],p[100001];
int n,i,poz1,j,k;
int main()
{
ifstream f("scmax.in");
ofstream g("scmax.out");
f>>n;
f>>v;
poz1=1;
u[1]=v;
k=1;
for(i=2;i<=n;i++)
{
f>>n;
if(n>=v) {if(n!=v) {v=n;k++;u[k]=n;}}
else {if(k>poz1) {for(j=1;j<=k;j++) p[j]=u[j];poz1=k;}k=1;v=n;u[k]=n;}
}
for(j=1;j<=k;j++) p[j]=u[j];
poz1=k;
g<<poz1<<'\n';
for(i=1;i<=poz1;i++)
{
g<<p[i]<<" ";
}
return 0;
}