dp蒟蒻在线暴风流泪

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int a[N], dp1[N], dp2[N];
int main() {
    int n = 1;
    while(cin >> a[n]) n++;
    dp1[0] = 0;
    for(int i = 1; i <= n; i++) {
        dp1[i] = 1;
        for(int j = 1; j < i; j++) {
            if(a[j] >= a[i]) dp1[i] = max(dp1[i], dp1[j] + 1);
        }
    }
    dp2[0] = 0;
    for(int i = 1; i <= n; i++) {
        dp2[i] = 1;
        for(int j = 1; j < i; j++) {
            if(a[j] < a[i]) dp2[i] = max(dp2[i], dp2[j] + 1);
        }
    }
    int ans1 = 0, ans2 = 0;
    for(int i = 1; i <= n; i++) ans1 = max(ans1, dp1[i]), ans2 = max(ans2, dp2[i]);
    cout << ans1 << endl << ans2 << endl;
    return 0;
}