2015南阳理工CCPC The Battle of Chibi
来源:互联网 发布:手机硬件信息软件 编辑:程序博客网 时间:2024/05/21 14:55
The Battle of Chibi
Time Limit: 6000/4000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)
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
Actually, if you leak information with strict increasing value could accelerate making Cao Cao believe you. So Gai Huang decided to leak exact
Input
The first line of the input gives the number of test cases,
Each test case begins with two numbers
Output
For each test case, output one line containing Case #x: y
, where
The result is too large, and you need to output the result mod by
Sample input and output
23 21 2 33 23 2 1
Case #1: 3Case #2: 0
Hint
In the first cases, Gai Huang need to leak
Source
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N = 1010;const int MOD = 1000000007;int dp[N][N];struct node{int x, id;bool operator<(const node & a) const{return x < a.x;}}Node[N];struct array{int ary[N][N];void init() { memset(ary, 0, sizeof(ary)); }int lowbit(int x) {return x & (-x);}void insert(int r, int c, int x) {while (c < N) {ary[r][c] += x;while (ary[r][c] >= MOD) ary[r][c] -= MOD;c += lowbit(c);}}int query(int r, int c) {int ans = 0;while (c) {ans += ary[r][c];while (ans >= MOD) ans -= MOD;c -= lowbit(c);}return ans;}}tree;int main() {int T;int cnt = 0;scanf("%d", &T);while (T--) {int n, m;scanf("%d%d", &n, &m);int ary[N];for (int i = 1; i <= n; ++i) {scanf("%d", &Node[i].x);Node[i].id = i;}Node[0].x = 0;sort(Node + 1, Node + n + 1);int C = 1;for (int i = 1; i <= n; ++i)if (Node[i].x == Node[i - 1].x)ary[Node[i].id] = C;elseary[Node[i].id] = ++C;tree.init();for (int i = 1; i <= n; ++i) {int x = i < m ? i : m;dp[i][1] = 1;for (int j = 2; j <= x; ++j) dp[i][j] = tree.query(j - 1, ary[i] - 1);for (int j = 1; j <= i; ++j)tree.insert(j, ary[i], dp[i][j]);}int ans = 0;for (int i = m; i <= n; ++i) {ans += dp[i][m];while (ans >= MOD) ans -= MOD;}printf("Case #%d: %d\n", ++cnt, ans);}return 0;}
- 2015南阳理工CCPC The Battle of Chibi
- 2015CCPC南阳场 C - The Battle of Chibi
- 2015 南阳 CCPC hdu 5542 The Battle of Chibi(DP+树状数组优化+离散化)
- 南阳ccpc C题 The Battle of Chibi(树状数组优化+dp)
- 【HDU5542 2015 CCPC 南阳国赛C】【DP】The Battle of Chibi n个数中恰好长度为m的单升子序列数
- HDU5542-The Battle of Chibi
- The Battle of Chibi HDU
- hdu 5542 The Battle of Chibi
- HDU5542 The Battle of Chibi (DP)
- HDU 5542 The Battle of Chibi
- HDU 5542 The Battle of Chibi
- HDU5542 The Battle of Chibi【DP】
- 2015南阳理工CCPC Sudoku
- HDU-5542-The Battle of Chibi【树状数组+dp】
- CDOJ 1217 The Battle of Chibi【树状数组+dp】
- HDU 5542 The Battle of Chibi(DP+树状数组)
- HDU 5542 The Battle of Chibi(树状数组+dp)
- HDU 5542 The Battle of Chibi 树状数组+dp+优化
- HTTP简介<学习笔记>
- ios入门攻略 03篇 C语言基础【运算符】
- Codeforces Round #327 (Div. 2)C. Median Smoothing
- 使用wireshark分析TCP/IP协议中TCP包头的格式
- UEST OJ1222(DFS)
- 2015南阳理工CCPC The Battle of Chibi
- uva11129
- 有用的信息
- C SSDP 发现设备实现
- 查看android模拟器里的sqlite数据库
- linux如何查看系统信息
- Android RecyclerView 使用解析
- uva10154
- Leetcode Game of Life