poj 1952 BUY LOW, BUY LOWER 最长下降子序列计数

//poj 1952
//sep9
#include <iostream>
using namespace std;
const int maxN=5012;
int a[maxN];
int dp[maxN];
int num[maxN];
int main()
{
	int i,j,n,ans=0,ansNum=0;
	scanf("%d",&n);
	for(i=1;i<=n;++i)
		scanf("%d",&a[i]);
	for(i=1;i<=n;++i){
		dp[i]=1;
		num[i]=1;
		for(j=i-1;j>=0;--j)
			if(a[j]>a[i]){
				if(dp[j]+1==dp[i])
					num[i]+=num[j];
				else if(dp[j]+1>dp[i]){
					dp[i]=dp[j]+1;
					num[i]=num[j];
				}
			}
			else if(a[j]==a[i]){
				if(dp[i]==1)
					num[i]=0;
				break;
			}
		ans=max(ans,dp[i]);	
	}
	for(i=1;i<=n;++i)	
		if(dp[i]==ans)
			ansNum+=num[i];
	printf("%d %d",ans,ansNum);
	return 0;	
}