SMMR-T157: Dunning-Kruger Effect

#include <iostream>
#include <vector>
using namespace std;

int main(){

    int n;
    scanf("%d", &n);
    vector<int> num(n + 1, 0);
    for(int i = 1; i <= n; ++i){
        scanf("%d", &num[i]);
    }

    vector<int> left(n + 1, 0);
    for(int i = 1; i <= n; ++i){
        int mx = 0;
        for(int j = 1; j < i; ++j){
            if(num[j] > num[i]){
                mx = max(mx, left[j]);
            }
        }
        left[i] = mx + 1;
    }

    vector<int> right(n + 1, 0);
    for(int i = n; i >= 1; --i){
        int mx = 0;
        for(int j = n; j > i; --j){
            if(num[j] > num[i]){
                mx = max(mx, right[j]);
            }
        }
        right[i] = mx + 1;
    }

    int mx = 0;
    for(int i = 1; i <= n; ++i){
        mx = max(mx, left[i] + right[i] - 1);
    }

    cout << mx;

    return 0;
}