zoj2402 Lenny's Lucky Lotto Lists(DP)

/*

 简单的DP，类似于LIS的求解过程
 分析：设状态为 F[ i ][ j ] 表示 以j为结束长度为i的串的个数
    F[ i ][ j ] = Sum{ F[ i-1 ][ k ] } ( 2^(i-2) <= k <= j/2 )
   
    再用S[ i ][ j ]求出长度为i结束不超过j的串的个数就可以了

*/

View Code

 1 #include <iostream>
 2 #include <cstdlib>
 3 #include <cstring>
 4 
 5 using namespace std;
 6 
 7 long long F[ 11 ][ 2001 ];
 8 long long S[ 11 ][ 2001 ];
 9 
10 int main()
11 {
12     //打表 
13     memset( F, 0L, sizeof( F ) );
14     memset( S, 0L, sizeof( S ) );
15     
16     F[ 0 ][ 0 ] = 1L;
17     for ( int i = 1 ; i <= 10 ; ++ i )
18     for ( int j = (1<<(i-1)) ; j <= 2000 ; ++ j ) {
19         for ( int k = (1<<(i-1))/2 ; k <= (j>>1) ; ++ k )
20             F[ i ][ j ] += F[ i-1 ][ k ];
21         S[ i ][ j ] = S[ i ][ j-1 ] + F[ i ][ j ];
22     }
23     //
24     int t,n,m;
25     while ( cin >> t )
26     for ( int c = 1 ; c <= t ; ++ c ) {
27         cin >> n >> m;
28         cout << "Case " << c << ": n = " << n << ", m = " << m << ", # lists = " << S[ n ][ m ] << endl;
29     }
30     return 0;
31 }

转载于:https://www.cnblogs.com/-xiaobai-/archive/2011/08/17/2143085.html