Cod sursa(job #308738)
Utilizator | Data | 28 aprilie 2009 13:07:45 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<stdio.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]);
}
return 0;
}