USACO4.3.1 Buy Low, Buy Lower (buylow)

第一问最长下降子序列

第二问求最长下降子序列的个数

/* 
ID: xsy97051 
PROG: buylow 
LANG: C++ 
*/  
#include <cstdio>  
#include <algorithm>  
#include <iostream>  
using namespace std;  
#define MAXN 100005  
int a[MAXN],dp[MAXN],r[MAXN],n;  
int main()  
{  
    freopen("buylow.in","r",stdin);  
    freopen("buylow.out","w",stdout);  
    cin>>n;
    int ans1=0,ans2=0;  
    for(int i=1;i<=n;i++)  
    {  
        cin>>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];    
    cout<<ans1<<" "<<ans2<<endl;  
    return 0;  
}