void findLongest(const int *a, const int length)
{
int b[6];
int c[6];
c[0] = 0;
c[1] = 0;
c[2] = -1;
c[3] = 0;
c[4] = 0;
c[5] = -1;
for(int i = 1; i < length; ++i){
b[3] = c[3];
b[4] = c[4];
b[5] = c[5];
if(a[i]>a[i-1]){
if(c[2] == -1){
b[0] = c[0];
b[1] = c[1]+1;
b[2] = -1;
}else{
b[0] = i-1;
b[1] = i;
b[2] = -1;
}
}else{
b[0] = c[0];
b[1] = c[1];
b[2] = i;
}
if(b[2]-b[0] > b[5] - b[3]){
b[3] = b[0];
b[4] = b[1];
b[5] = b[2];
}
c[0] = b[0];
c[1] = b[1];
c[2] = b[2];
c[3] = b[3];
c[4] = b[4];
c[5] = b[5];
}
if(b[5] == -1){
cout<<"-1 -1"<<endl;
return ;
}
cout<<b[3]<<" "<<b[5]<<endl;
for(int i = b[3]; i <= b[4]; ++i){
printf("%d ",a[i]);
}
printf("\n");
for(int i = b[4]; i <= b[5]; ++i){
printf("%d ",a[i]);
}
printf("\n");
}