usaco buylow dp+记录路径

/*
ID: xujiahe1
PROG: buylow
LANG: C++
*/
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
#define MAXN 100005
#define INF 0x3f3f3f3f
int a[MAXN],dp[MAXN],r[MAXN],n;
int main()
{
    freopen("buylow.in","r",stdin);
    freopen("buylow.out","w",stdout);
    scanf("%d",&n);
    {
        int ans1=0,ans2=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            r[i]=1;
            dp[i]=1;
        }
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<i;j++)
            {
                if(a[j]>a[i])
                {
                    if(dp[j]+1>dp[i])
                    {
                        dp[i]=dp[j]+1;
                        r[i]=r[j];
                    }
                    else if(dp[j]+1==dp[i])
                    {
                        r[i]+=r[j];
                    }
                }
            }
            for(int j=1;j<i;j++)
            {
                if(a[j]==a[i]&&dp[j]==dp[i]) r[j]=0;
            }
            ans1=max(ans1,dp[i]);
        }
        for(int i=1;i<=n;i++)
        {
            if(dp[i]==ans1) ans2+=r[i];
        }
        printf("%d %d\n",ans1,ans2);
    }
    return 0;
}
/*
6
5 2 3 2 4 2

*/