http://acm.xidian.edu.cn/problem.php?id=1181
开始以为是离线处理的……然后发现离线做不行,在线做不会啊就放弃了
看了解题报告之后知道就是一个存储历史状态的树状数组,存储了以前时间的修改
树状数组单点修改修改一个点会影响logn个点,这些点的vector都要更新一个新时间(因为是在线操作,时间是按顺序的)
然后查找一个操作时间的时候,在进行sum的时候每次都要找这个区间<= t的最大的时间修改的值,然后全部加起来
找<=t的最大时间的时候要用二分……不然会超时
这题是个空间和时间都很多的题……挺麻烦的不过也是有点收获,在时间上利用树状数组,记录每个区间被修改都要新标记一次
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn = 1000010;
struct st
{
int v;
int time;
st(int a,int b):v(a),time(b){}
st(){
}
};
int n,q;
vector<st> tree[maxn];
int cur[maxn];
int count (int x,int time){
int left = 0,right = tree[x].size() - 1;
int mid = (left + right)/2 + 1;
while(left != right){
if (tree[x][mid].time <= time){
left = mid;
mid = (left + right)/2 + 1;
}
else{
right = mid - 1;
mid = (left + right)/2 + 1;
}
}
return tree[x][left].v;
}
int count2(int x,int time){//用这个顺序搜索就会超时
int ans = 0;
for(int i = 1; i < tree[x].size() ; i++){
if (tree[x][i].time > time) return tree[x][ans].v;
ans = i;
}
return tree[x][ans].v;
}
int lowbit(int x){
return x & -x;
}
int sum(int x,int time){
if (x == 0) return 0;
int ret = 0;
while(x > 0){
ret += count2(x,time);
x -= lowbit(x);
}
return ret;
}
void add(int x,int d,int time){
while(x <= n){
tree[x].push_back(st(tree[x][tree[x].size() - 1].v + d,time));
x += lowbit(x);
}
}
int main()
{
scanf("%d %d",&n,&q);
int c = 0;
int cnt = 1;
for(int i = 1; i <= n; i++){
tree[i].push_back(st(0,0));
cur[i] = 0;
}
for(int i = 1; i <= q; i++){
int type;
scanf("%d",&type);
if (type == 1){
int ii,x;
scanf("%d %d",&ii,&x);
add(ii^c,x,cnt);
cnt++;
cur[ii^c] += x;
c = cur[ii^c];
}
else{
int l,r,t;
scanf("%d %d %d",&l,&r,&t);
int left = l^c;
int right = r^c;
left = min(l^c,r^c);
right = max(l^c,r^c);
if (left > n){
printf("%d\n",0);
c = 0;
}
else{
right = min(right,n);
left = max(1,left);
printf("%d\n",c = (sum(right,t) - sum(left - 1,t)));
}
}
}
return 0;
}