The 2015 China Collegiate Programming Contest C. The Battle of Chibi hdu 5542

The Battle of Chibi

Time Limit: 6000/4000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)
Total Submission(s): 591    Accepted Submission(s): 192

Problem Description

Cao Cao made up a big army and was going to invade the whole South China. Yu Zhou was worried about it. He thought the only way to beat Cao Cao is to have a spy in Cao Cao's army. But all generals and soldiers of Cao Cao were loyal, it's impossible to convince any of them to betray Cao Cao.

So there is only one way left for Yu Zhou, send someone to fake surrender Cao Cao. Gai Huang was selected for this important mission. However, Cao Cao was not easy to believe others, so Gai Huang must leak some important information to Cao Cao before surrendering.

Yu Zhou discussed with Gai Huang and worked out N information to be leaked, in happening order. Each of the information was estimated to has ai value in Cao Cao's opinion.

Actually, if you leak information with strict increasing value could accelerate making Cao Cao believe you. So Gai Huang decided to leak exact M information with strict increasing value in happening order. In other words, Gai Huang will not change the order of the N information and just select M of them. Find out how many ways Gai Huang could do this.

 

 

Input

The first line of the input gives the number of test cases, T(1≤100). T test cases follow.

Each test case begins with two numbers N(1≤N≤103) and M(1≤M≤N), indicating the number of information and number of information Gai Huang will select. Then N numbers in a line, the ith number ai(1≤ai≤109) indicates the value in Cao Cao's opinion of the ith information in happening order.

 

 

Output

For each test case, output one line containing Case #x: y, where x is the test case number (starting from 1) and y is the ways Gai Huang can select the information.

The result is too large, and you need to output the result mod by 1000000007(109+7).

 

 

Sample Input

2 3 2 1 2 3 3 2 3 2 1

 

 

Sample Output

Case #1: 3 Case #2: 0

Hint

In the first cases, Gai Huang need to leak 2 information out of 3. He could leak any 2 information as all the information value are in increasing order. In the second cases, Gai Huang has no choice as selecting any 2 information is not in increasing order.

 

 

题意：求n个数的长度为m的严格最长上升子序列有多少种？

分析：

一个很显然的dp

dp[i][j]代表现在选了i个，最后一个是第j个数的种数。

转移方程就是把dp[i][k]，a[k]<a[j]的所有方案数加起来

转移的话可以考虑树状数组。

#include <cstdio>
#include <iostream>
#include <map>
#include <algorithm>
using namespace std;

const int N = 1010, Mod = 1000000007;
int n, m, arr[N];
int dp[N][N], tr[N][N];
map<int, int> Hash;
int tmp[N], tot;

inline int Lowbit(int x)
{
    return x & (-x);
}

inline void Plus(int &x, int y)
{
    x = x + y;
    if(x >= Mod) x -= Mod;
}

inline void Add(int index, int x, int val)
{
    x++;
    for( ; x <= tot + 1; x += Lowbit(x)) Plus(tr[index][x], val);
}

inline int Query(int index, int x)
{
    int ret = 0;
    x++;
    for( ; x; x -= Lowbit(x)) Plus(ret, tr[index][x]);
    return ret;
}

inline void Solve()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++) scanf("%d", &arr[i]);
    
    Hash.clear();
    for(int i = 1; i <= n; i++) tmp[i] = arr[i];
    sort(tmp + 1, tmp + 1 + n);
    tot = 1;
    Hash[tmp[1]] = 1;
    for(int i = 2; i <= n; i++)
        if(tmp[i] != tmp[i - 1])
            Hash[tmp[i]] = ++tot;
    
    for(int i = 1; i <= n; i++) arr[i] = Hash[arr[i]];
    /*for(int i = 1; i <= n; i++)
        printf(i < n ? "%d " : "%d\n", arr[i]);*/
    
    for(int i = 0; i <= m; i++)
        for(int j = 0; j <= tot + 1; j++) tr[i][j] = 0;
    for(int i = 0; i <= m; i++) dp[0][n] = 0;
    dp[0][0] = 1;
    Add(0, 0, 1);
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            dp[i][j] = 0;
            int cnt = Query(j - 1, arr[i] - 1);
            Plus(dp[i][j], cnt);
            Add(j, arr[i], dp[i][j]);
        }
    }
    
    int ans = 0;
    for(int i = 1; i <= n; i++) Plus(ans, dp[i][m]);
    printf("%d\n", ans);
}

int main()
{
    int test;
    scanf("%d", &test);
    for(int testnumber = 1; testnumber <= test; testnumber++)
    {
        printf("Case #%d: ", testnumber);
        Solve();
    }
    return 0;
}