# hdu5542 The Battle of Chibi【树状数组】【离散化】

2022年11月23日
0 收藏 373 点赞 2,632 浏览 3674 个字

# The Battle of Chibi

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

Problem DescriptionCao 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.

InputThe 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.

OutputFor 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 Input2
3 2
1 2 3
3 2
3 2 1 Sample OutputCase #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.

SourceThe 2015 China Collegiate Programming Contest Recommendwange2014   |   We have carefully selected several similar problems for you:  6447 6446 6445 6444 6443

` #include <iostream> #include <set> #include <cmath> #include <stdio.h> #include <cstring> #include <algorithm> #include <map> using namespace std; typedef long long LL; #define inf 0x7f7f7f7f int t, n, m, cnt; const int maxn = ; const LL mod = 1e9 + ; int a[maxn], b[maxn]; LL sum[maxn], dp[maxn][maxn]; map<LL, int>discrete; set<LL>sss; set<LL>::iterator iter; void add(int pos, LL x) {     while(pos <= n + ){         sum[pos] = (sum[pos] + x) % mod;         pos += (pos & -pos);     } } LL ask(int pos) {     LL ans = ;     while(pos){         ans = (ans + sum[pos]) % mod;;         pos -= (pos & -pos);     }     return ans; } void init() {     discrete.clear();     sss.clear();     //memset(dp, 0, sizeof(dp));     for(int i = ; i <= m; i++){         for(int j = ; j <= n; j++){             dp[i][j] = ;         }     }     cnt = ; } int main() {     scanf("%d", &t);     for(int cas = ; cas <= t; cas++){         init();         scanf("%d%d", &n, &m);         a[] = b[] = -inf;         dp[][] = ;         //sss.insert(a[0]);         for(int i = ; i <= n; i++){             scanf("%d", &a[i]);             b[i] = a[i];             //sss.insert(a[i]);         }         sort(b, b + n + );         for(int i = ; i <= n; i++){             a[i] = lower_bound(b, b +  + n, a[i]) - b + ;             //cout<<a[i]<<endl;         }         /*for(iter = sss.begin(); iter != sss.end(); iter++){             discrete[*iter] = ++cnt;         }*/         //cout<<a[0]<<endl;         for(int i = ; i <= m; i++){             //memset(sum, 0, sizeof(sum));             for(int j = ; j <= n + ; j++){                 sum[j] = ;             }             add(a[], dp[i - ][]);             for(int j = ; j <= n; j++){                 dp[i][j] = ask(a[j] - );                 //if(discrete[a[j]] < discrete[a[j + 1]])                 add(a[j], dp[i - ][j]);             }         }         int ans = ;         for(int i = ; i <= n; i++){             ans = (ans + dp[m][i]) % mod;         }         printf("Case #%d: %d\n", cas, ans);     } }`

python开发_常用的python模块及安装方法

Educational Codeforces Round 11 C. Hard Process 二分
C. Hard Process题目连接：http://www.codeforces.com/contest/660/problem/CDes…

zengkefu@server1:/usr/src\$ uname -aLinux server1 4.10.0-19-generic #21…

Android调用系统相机、自定义相机、处理大图片
Android调用系统相机和自定义相机实例本博文主要是介绍了android上使用相机进行拍照并显示的两种方式，并且由于涉及到要把拍到的照片显…

Struts的使用

400-888-8888

ceotheme@ceo.com