BOJ)11054 가장 긴 바이토닉 부분 수열

https://www.acmicpc.net/problem/11054

#include <iostream>
using namespace std;
 
int arr[1001];
pair <int, int> dp[1001];
int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> arr[i];
    }
 
    for (int i = 0; i < n; i++) {
        dp[i].first = 1;
        for (int j = 0; j < i; j++) {
            if (arr[j] < arr[i] && dp[i].first < dp[j].first + 1) {
                dp[i].first = dp[j].first + 1;
            }
        }
    }
 
    for (int i = n-1; i >= 0; i--) {
        dp[i].second = 0;
        for (int j = n-1; j >= i; j--) {
            if (arr[j] < arr[i] && dp[i].second < dp[j].second + 1) {
                dp[i].second = dp[j].second + 1;
            }
        }
    }
    
    int result = 0;
    for (int i = 0; i < n; i++) {
        int t = dp[i].first + dp[i].second;
        result = result < t ? t : result;
    }
 
    cout << result;
}