poj 1952 最长公共子序列计数

　　看代码就懂了  不解释  3 1 1 1 1 2 2 2 1 1 1 3  第一个3 和最后一个 3 只需要一个就够了，，，

#include<iostream>
#include<cstring>
#include<algorithm>
#include<stdio.h>
#include<cmath>
using namespace std;

int dp[5005],num[5005],arr[5005];
int main( )
{
    int N; scanf("%d",&N);
        for( int i = 1; i <= N; i++ )
        {
            scanf("%d",&arr[i]);
            dp[i] = num[i] = 1;
        }
        int Max = 0;
        for( int i = 2; i <= N; i++ )
        for( int j = i-1; j >= 1; j-- )
        if( arr[i] < arr[j] )
        {
            if( dp[j]+1 > dp[i] )
            {
                 dp[i] =  dp[j]+1;
                num[i] = num[j];
            }else if( dp[j]+1 == dp[i] )
                num[i] += num[j];
        }else if( arr[i] == arr[j] )
        {
            if( dp[i] == 1 )num[i] = 0;
            break;
        }
        for( int i = 1; i <= N; i++ )
        Max = max( Max,dp[i] );
        int res = 0;
        for( int i = 1; i <= N; i++ )
        if( dp[i] == Max )res+=num[i];
        cout<<Max<<" "<<res<<endl;
    return 0;
}