Pagini recente » Cod sursa (job #2493037) | Cod sursa (job #1720700) | Cod sursa (job #1025342) | Cod sursa (job #150100) | Cod sursa (job #1013213)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long n,a[100001],max,pi,pf,p,q,i,x,nr1;
ifstream f("scmax.in");
ofstream g("scmax.out");
max=0;
f>>n>>a[1]>>a[2];
i=2;
while(i<=n)
{
// i++;
// f>>a[i];
if(a[i-1]<a[i])
{ nr1=0;
pi=i-1;
while(a[i-1]<a[i] && i<=n)
{
pf=i;
i++;
f>>a[i];
while(a[i-1]==a[i] && i<=n)
{ nr1++;
a[i-1]=0;
pf=i;
i++;
f>>a[i];
}
}
if(pf-pi+1-nr1>max)
{
max=pf-pi+1-nr1;
p=pi;
q=pf;
}
}
else
{
i++;
f>>a[i];
}
}
g<<max<<endl;
for(i=p;i<=q;i++)
if(a[i]!=0)
g<<a[i]<<" ";
f.close();
g.close();
return 0;
}