#include<iostream>
#include<string>
#include<algorithm>
#include<limits.h>
#include<vector>
#include<map>
#include<math.h>
#include<list>
#include<fstream>
#include<assert.h>
using namespace std;
int getMax(int n, int* mine){
// int mine[n] = *array;
int max_mine[n]={0};
max_mine[0]=1;
int max=1, maxi=1;;
for(int i =1; i<n ;i++){
if(mine[i]>mine[i-1]){
max_mine[i] = max_mine[i-1]+1;
if(max<max_mine[i]){
max = max_mine[i];
maxi = i;
}
}
else
max_mine[i]=1;
}
cout<<"Max seq: ";
for(int i = max; i>0; i--)
cout<< mine[maxi-i+1]<<" ";
return max;
}
int main(){
int n= 7;
int arr[7]={5,6,7,5,12,13, 16};
cout<<"max:"<<getMax(n,arr)<<"\n";
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPHN0cmluZz4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZTxsaW1pdHMuaD4KI2luY2x1ZGU8dmVjdG9yPgojaW5jbHVkZTxtYXA+CiNpbmNsdWRlPG1hdGguaD4KI2luY2x1ZGU8bGlzdD4KI2luY2x1ZGU8ZnN0cmVhbT4KI2luY2x1ZGU8YXNzZXJ0Lmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgZ2V0TWF4KGludCBuLCBpbnQqIG1pbmUpewogCi8vICBpbnQgbWluZVtuXSA9ICphcnJheTsKIAogIGludCBtYXhfbWluZVtuXT17MH07CiAKIG1heF9taW5lWzBdPTE7CiBpbnQgbWF4PTEsIG1heGk9MTs7CiAgZm9yKGludCBpID0xOyBpPG4gO2krKyl7CiAgICBpZihtaW5lW2ldPm1pbmVbaS0xXSl7CiAgICAgICAgbWF4X21pbmVbaV0gPSAgbWF4X21pbmVbaS0xXSsxOwogICAgICAgIGlmKG1heDxtYXhfbWluZVtpXSl7CiAgICAgICAgICAgIG1heCA9IG1heF9taW5lW2ldOwogICAgICAgICAgICBtYXhpID0gaTsKICAgICAgICB9CiAgICB9CiAgICBlbHNlCiAgICAgICAgbWF4X21pbmVbaV09MTsKICB9CiAgCiAgY291dDw8Ik1heCBzZXE6ICI7CiAgZm9yKGludCBpID0gbWF4OyBpPjA7IGktLSkKICAgIGNvdXQ8PCBtaW5lW21heGktaSsxXTw8IiAiOwogIAogcmV0dXJuIG1heDsKfQoKaW50IG1haW4oKXsKICAgIGludCBuPSA3OwogICAgaW50IGFycls3XT17NSw2LDcsNSwxMiwxMywgMTZ9OwoKICAgIGNvdXQ8PCJtYXg6Ijw8Z2V0TWF4KG4sYXJyKTw8IlxuIjsKICAgIHJldHVybiAwOwp9