rendered paste body#include <iostream>#include <algorithm>#include <cstring>using namespace std;#define FOREVER() while(true)#define FOR(i,n) for(int i=0; i<n; ++i)#define FORR(i,n) for(int i=n-1; i>=0; --i)#define FORAB(i, lo, hi) for(int i=lo; i<=hi; ++i)#define FORRAB(i, lo, hi) for(int i=hi; i>=lo; --i)#define SET(arr, val) memset(arr, val, sizeof(arr));const int N=10000;int pancakes[N+10], best_sequence[N+10];int main() { int n; scanf("%d", &n); FOR(i, n) scanf("%d", pancakes+i); FORAB(i, 0, n-1) { best_sequence[i] = 1; FORAB(j, 0, i-1) { if (pancakes[j] > pancakes[i] && best_sequence[j] >= best_sequence[i]) { best_sequence[i] = best_sequence[j]+1; } } } int *count_array = pancakes; SET(pancakes, 0); FOR(i, n) { ++count_array[best_sequence[i]]; } printf("%d\n", *max_element(count_array, count_array+n)); return 0;}