题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4217
题意:给你n和k,n代表[1,n]的序列,下面k个数字代表拿走第ki小的数字,让你求拿走数字的总和。
思路:树状数组初始化为1,那么树状数组的sum数组一定是有序的,然后我们就可以二分查找第k小,每次操作后要把第k小加上-1也就是去掉这个数字。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<bitset>
#include<cstdlib>
#include<cmath>
#include<set>
#include<list>
#include<deque>
#include<map>
#include<math.h>
#include<queue>
#define inf 0x3f3f3f3f3f3f3f3f
using namespace std;
typedef long long ll;
const int N = 3e5 + 7;
int n, k;
ll c[N * 5];
void add(int p, int x)
{
for(int i = p; i <= n; i += i&-i)
c[i] += x;
}
ll sum(int p)
{
ll sum = 0;
for(int i = p; i >= 1; i -= i&-i)
sum += c[i];
return sum;
}
int main()
{
int t; scanf("%d",&t);
int cnt = 1;
while(t--)
{
scanf("%d%d",&n,&k);
memset(c, 0, sizeof(c));
for(int i = 1; i <= n; i++) add(i, 1);
ll ans = 0;
for(int i = 1; i <= k; i++)
{
int x; scanf("%d",&x);
int l = 1, r = n, pos = 0;
while(l < r)
{
int mid = (l + r) >> 1;
ll tot = sum(mid);
if(tot >= x) r = mid;
else l = mid + 1;
}
ans += l; add(l, -1);
}
printf("Case %d: %lld\n",cnt++,ans);
}
}