WA #7 #8 #9

#include <bits/stdc++.h>
using namespace std;

int n, maxn, tot, a[5005], f[5005], dp[5005];
//以i为开头的最长公共子序列
int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++) cin >> a[i], dp[i] = 1;
    for (int i = n; i >= 1; i --)
        for (int j = i + 1; j <= n; j ++)
            if (a[i] > a[j]) 
                dp[i] = max(dp[i], dp[j] + 1);
    for (int i = 1; i <= n; i ++) maxn = max(maxn, dp[i]);
    cout << maxn << " ";
    for (int i = n; i >= 1; i --)
    {
        if (dp[i] == 1) f[i] = 1;
        for (int j = i + 1; j <= n; j ++)
            if (a[i] == a[j] && dp[i] == dp[j]) f[j] = 0;
            else if (a[i] > a[j] && dp[i] == dp[j] + 1) f[i] += f[j];
        if (dp[i] == maxn) tot += f[i];
    }
    cout << tot << endl;
    return 0;
}