题目:题目链接
题意:题目意思就是给你1--N的数,然后在给出K个数,每次取出地Ki小的数字,取完之后把这个数字去掉,问最后取出的这K个数字的总和是多少?
分析:以前没有接触线段树之类的,碰到的话肯定会直接暴力写,必T无疑,接触线段树,那么这种题目还是得用线段
树来写。对线段树不熟,这道题目就是一个模版题吧:
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int gcd(int n,int m)
{
if(n<m) swap(n,m);
return n%m==0?m:gcd(m,n%m);
}
int lcm(int n,int m)
{
if(n<m) swap(n,m);
return n/gcd(n,m)*m;
}
#define N 262145
int prime[N];
struct node
{
int i, left, right, sum;
}vert[N<<2];
void getPrime();
void bash();
void wzf();
void SG();
int QuickMod(int a, int b, int n);
int treeNode;
int build(int i, int left, int right)
{
int mid;
vert[i].left = left;
vert[i].right = right;
vert[i].sum = right-left+1;
if(left == right)
{
vert[i].i = ++treeNode;
return 0;
}
mid = (left+right)>>1;
build(i<<1, left, mid);
build((i<<1)+1, mid+1, right);
return 0;
}
int query(int i, int n, int goal)
{
int res;
if(vert[i].left == vert[i].right)
{
vert[i].sum = 0;
return vert[i].i;
}
if(goal <= vert[i<<1].sum)
{
res = query(i<<1, n, goal);
}
else
{
res = query((i<<1)+1, n, goal-vert[i<<1].sum);
}
vert[i].sum--;
return res;
}
int main()
{
// freopen("D:\\in.txt", "r", stdin);
// freopen("D:\\out.txt", "w", stdout);
int k, m, n, t;
int cnt = 0;
__int64 sum;
scanf("%d", &t);
while(t--)
{
cnt++;
sum = 0;
treeNode = 0;
scanf("%d%d", &n, &m);
build(1, 1, n);
for(int i = 0; i <m ;++i)
{
scanf("%d", &k);
sum += query(1, n, k);
}
printf("Case %d: %I64d\n", cnt, sum);
}
return 0;
}
int QuickMod(int a,int b,int n)
{
int r = 1;
while(b)
{
if(b&1)
r = (r*a)%n;
a = (a*a)%n;
b >>= 1;
}
return r;
}
void getPrime()
{
memset(prime, 0, sizeof(prime));
prime[0] = 1;
prime[1] = 1;
for(int i = 2; i < N; ++i)
{
if(prime[i] == 0)
{
for(int j = i+i; j < N; j+=i)
prime[j] = 1;
}
}
}
void bash(int n, int m)
{
if(n%(m+1) != 0)
printf("1\n");
else
printf("0\n");
}
void wzf(int n, int m)
{
if(n > m)
swap(n, m);
int k = m-n;
int a = (k * (1.0 + sqrt(5.0))/2.0);
if(a == n)
printf("0\n");
else
printf("1\n");
}
int numsg[N];
void SG(int n)
{
int sum = 0;
for(int i=0; i < n; i++)
{
scanf("%d",&numsg[i]);
sum ^= numsg[i];
}
if(sum == 0)
printf("No\n");
else
{
printf("Yes\n");
for(int i = 0; i < n; i++)
{
int s = sum ^ numsg[i];
if(s < numsg[i])
printf("%d %d\n", numsg[i], s);//从有num[i]个石子的堆后剩余s个石子
}
}
}