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