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

最新推荐文章于 2020-08-05 21:05:26 发布

转载最新推荐文章于 2020-08-05 21:05:26 发布 · 251 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

原文链接：http://www.cnblogs.com/StupidBoy/p/5063640.html

标签

#java

本文详细解析了一道关于寻找特定长度严格上升子序列的问题，即赤壁之战算法题目。通过动态规划与树状数组优化，文章展示了如何计算给定序列中满足条件的子序列数量，提供了一个清晰的解决方案。

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

Input

The first line of the input gives the number of test cases,

Output

For each test case, output one line containing Case #x: y, where

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]的所有方案数加起来

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

 1 #include <cstdio>
 2 #include <iostream>
 3 #include <map>
 4 #include <algorithm>
 5 using namespace std;
 6 
 7 const int N = 1010, Mod = 1000000007;
 8 int n, m, arr[N];
 9 int dp[N][N], tr[N][N];
10 map<int, int> Hash;
11 int tmp[N], tot;
12 
13 inline int Lowbit(int x)
14 {
15     return x & (-x);
16 }
17 
18 inline void Plus(int &x, int y)
19 {
20     x = x + y;
21     if(x >= Mod) x -= Mod;
22 }
23 
24 inline void Add(int index, int x, int val)
25 {
26     x++;
27     for( ; x <= tot + 1; x += Lowbit(x)) Plus(tr[index][x], val);
28 }
29 
30 inline int Query(int index, int x)
31 {
32     int ret = 0;
33     x++;
34     for( ; x; x -= Lowbit(x)) Plus(ret, tr[index][x]);
35     return ret;
36 }
37 
38 inline void Solve()
39 {
40     scanf("%d%d", &n, &m);
41     for(int i = 1; i <= n; i++) scanf("%d", &arr[i]);
42     
43     Hash.clear();
44     for(int i = 1; i <= n; i++) tmp[i] = arr[i];
45     sort(tmp + 1, tmp + 1 + n);
46     tot = 1;
47     Hash[tmp[1]] = 1;
48     for(int i = 2; i <= n; i++)
49         if(tmp[i] != tmp[i - 1])
50             Hash[tmp[i]] = ++tot;
51     
52     for(int i = 1; i <= n; i++) arr[i] = Hash[arr[i]];
53     /*for(int i = 1; i <= n; i++)
54         printf(i < n ? "%d " : "%d\n", arr[i]);*/
55     
56     for(int i = 0; i <= m; i++)
57         for(int j = 0; j <= tot + 1; j++) tr[i][j] = 0;
58     for(int i = 0; i <= m; i++) dp[0][n] = 0;
59     dp[0][0] = 1;
60     Add(0, 0, 1);
61     for(int i = 1; i <= n; i++)
62     {
63         for(int j = 1; j <= m; j++)
64         {
65             dp[i][j] = 0;
66             int cnt = Query(j - 1, arr[i] - 1);
67             Plus(dp[i][j], cnt);
68             Add(j, arr[i], dp[i][j]);
69         }
70     }
71     
72     int ans = 0;
73     for(int i = 1; i <= n; i++) Plus(ans, dp[i][m]);
74     printf("%d\n", ans);
75 }
76 
77 int main()
78 {
79     int test;
80     scanf("%d", &test);
81     for(int testnumber = 1; testnumber <= test; testnumber++)
82     {
83         printf("Case #%d: ", testnumber);
84         Solve();
85     }
86     return 0;
87 }

View Code

转载于:https://www.cnblogs.com/StupidBoy/p/5063640.html