Pagini recente » Cod sursa (job #621804) | Cod sursa (job #641780) | Cod sursa (job #1437602) | Cod sursa (job #1804317) | Cod sursa (job #716792)
Cod sursa(job #716792)
#include<fstream>
using namespace std;
int a[100000],b[100000],c[100000][2],n;
void maxim()
{
freopen("scmax.out","w",stdout);
int i,m=0,p;
for(i=0;i<n;i++)
if(b[i]>m)
{
p=i;
m=b[i];
}
printf("%d\n",m);
for(i=c[p][0];i<=c[p][1];i++)
{
while(a[i]==a[i+1] && i!=c[p][1])
i++;
printf("%d ",a[i]);
}
printf("\n");
}
int main()
{
int i,j;
freopen("scmax.in","r",stdin);
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
b[i]=1;
c[i][0]=c[i][1]=i;
for(j=i-1;j>=0;j--)
if(a[j]<a[i])
{
b[i]=b[j]+1;
c[i][0]=c[j][0];
break;
}
}
maxim();
return 0;
}