Pagini recente » Cod sursa (job #1884219) | Cod sursa (job #444047) | Cod sursa (job #753692) | Cod sursa (job #2592689) | Cod sursa (job #308737)
Cod sursa(job #308737)
#include<stdio.h>
#include<conio.h>
int main()
{
long n,w,v[100010],q=0,max=0;
scanf("%d",&n);
v[n+1]=-1;
scanf("%d",&v[1]);
for(int i=2;i<=n;++i)
{
scanf("%d",&v[i]);
if(v[i-1]<v[i])
{
++q;
}
else if(v[i-1]!=v[i])
{
q=0;
}
if(q>max)
{
max=q;
w=i;
}
}
printf("%d\n",++max);
for(int i=w-max;i<=w;i++)
{
if(v[i]!=v[i+1])
printf("%d ",v[i]);
}
getch();
return 0;
}