题目大意:给n个数,求任意区间不相同数字之和。
题目分析:n个数是给定的,不会变了,区间也是给定的。由于要求任意区间不重复数字之和,那就和这道super mario非常类似了,我们可以离线处理所有询问。由于要求不重复数字之和,我们把询问区间按右断点排序,这样从左往右扫描数列,如果以前没有出现的数字,直接插入,如果出现了,将这个数字上次出现的位置删去,在当前位置重新插入这个数。如果扫描的位置大于当前要查询的区间右端点,处理询问。由于所有要查询区间已按右端点排序,所以我们保证所有重复的数字也在靠右的地方插入,而每个重复的数字只插入了一次,所以可以保证所求区间数字和不重复。由于给定数字不超过1000000,所以直接开大数组搞,如果数字再大的话,就要哈希了。我的线段树跑了3000ms+,由于这题只要求区间和,所以BIT才是更好的选择,看了一下ranklist,好像都在1000ms+,说明这题的后台暑假还算给力啊哈哈。
线段树代码:
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 1000005;
const int NN = 50005;
typedef __int64 ll;
int hash[N];
int n,m;
int lcm[NN];
ll tree[NN<<2];
struct node
{
int l,r,id;
}ask[NN<<2];
ll ans[NN<<2];
int cmp(struct node a,struct node b)
{
if(a.r != b.r)
return a.r < b.r;
else
return a.l < b.l;
}
void build(int num,int s,int e)
{
tree[num] = 0;
if(s == e)
return;
int mid = (s + e)>>1;
build(num<<1,s,mid);
build(num<<1|1,mid + 1,e);
}
void insert(int num,int s,int e,int pos,int add)
{
if(s == e)
{
tree[num] += add;
return;
}
int mid = (s + e)>>1;
if(pos <= mid)
insert(num<<1,s,mid,pos,add);
else
insert(num<<1|1,mid + 1,e,pos,add);
tree[num] = tree[num<<1] + tree[num<<1|1];
}
ll query(int num,int s,int e,int l,int r)
{
if(s == l && r == e)
return tree[num];
int mid = (s + e)>>1;
if(r <= mid)
return query(num<<1,s,mid,l,r);
else
{
if(l > mid)
return query(num<<1|1,mid + 1,e,l,r);
else
return query(num<<1,s,mid,l,mid) + query(num<<1|1,mid + 1,e,mid + 1,r);
}
}
int main()
{
int i,t;
scanf("%d",&t);
while(t --)
{
scanf("%d",&n);
memset(hash,-1,sizeof(hash));
for(i = 1;i <= n;i ++)
scanf("%d",&lcm[i]);
scanf("%d",&m);
for(i = 0;i < m;i ++)
{
scanf("%d%d",&ask[i].l,&ask[i].r);
ask[i].id = i + 1;
}
sort(ask,ask + m,cmp);
build(1,1,n);
int j = 1;
for(i = 0;i < m;)
{
if(j <= ask[i].r)
{
if(hash[lcm[j]] == -1)
{
insert(1,1,n,j,lcm[j]);
hash[lcm[j]] = j;//记录位置
}
else//已经插过lcm[j]了
{
insert(1,1,n,hash[lcm[j]],-lcm[j]);//删除
hash[lcm[j]] = j;//更新位置
insert(1,1,n,j,lcm[j]);
}
j ++;
}
else
{
ans[ask[i].id] = query(1,1,n,ask[i].l,ask[i].r);
i ++;
}
}
for(i = 1;i <= m;i ++)
printf("%I64d\n",ans[i]);
}
return 0;
}
//3328MS 9380K
BIT代码:
#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 1000005;
const int NN = 50005;
typedef __int64 ll;
int hash[N];
int n,m;
int lcm[NN];
ll tree[NN<<2];
struct node
{
int l,r,id;
}ask[NN<<2];
ll ans[NN<<2];
int cmp(struct node a,struct node b)
{
if(a.r != b.r)
return a.r < b.r;
else
return a.l < b.l;
}
void build(int num,int s,int e)
{
memset(tree,0,sizeof(tree));
}
void insert(int num,int s,int e,int pos,int add)
{
int x = pos;
while(x <= e)
{
tree[x] += add;
x += x&(-x);
}
}
ll sum(int p)
{
ll ssum = 0;
while(p)
{
ssum += tree[p];
p -= p&(-p);
}
return ssum;
}
ll query(int num,int s,int e,int l,int r)
{
return sum(r) - sum(l - 1);
}
int main()
{
int i,t;
scanf("%d",&t);
while(t --)
{
scanf("%d",&n);
memset(hash,-1,sizeof(hash));
for(i = 1;i <= n;i ++)
scanf("%d",&lcm[i]);
scanf("%d",&m);
for(i = 0;i < m;i ++)
{
scanf("%d%d",&ask[i].l,&ask[i].r);
ask[i].id = i + 1;
}
sort(ask,ask + m,cmp);
build(1,1,n);
int j = 1;
for(i = 0;i < m;)
{
if(j <= ask[i].r)
{
if(hash[lcm[j]] == -1)
{
insert(1,1,n,j,lcm[j]);
hash[lcm[j]] = j;//记录位置
}
else//已经插过lcm[j]了
{
insert(1,1,n,hash[lcm[j]],-lcm[j]);//删除
hash[lcm[j]] = j;//更新位置
insert(1,1,n,j,lcm[j]);
}
j ++;
}
else
{
ans[ask[i].id] = query(1,1,n,ask[i].l,ask[i].r);
i ++;
}
}
for(i = 1;i <= m;i ++)
printf("%I64d\n",ans[i]);
}
return 0;
}
//2453MS 9916K
好像也不是很快啊。。。囧。。好吧,我写挫了肯定。。。
但是如果这样的话。。。
#include <iostream>
#include<cstdio>
#include<cctype>
#include<cstring>
using namespace std;
const int N = 1000005;
const int NN = 50005;
typedef __int64 ll;
int hash[N];
int n,m;
int lcm[NN];
ll tree[NN<<2];
struct node
{
int l,r,id;
}ask[NN<<2];
ll ans[NN<<2];
int cmp(struct node a,struct node b)
{
if(a.r != b.r)
return a.r < b.r;
else
return a.l < b.l;
}
void build(int num,int s,int e)
{
memset(tree,0,sizeof(tree));
}
void insert(int num,int s,int e,int pos,int add)
{
int x = pos;
while(x <= e)
{
tree[x] += add;
x += x&(-x);
}
}
ll sum(int p)
{
ll ssum = 0;
while(p)
{
ssum += tree[p];
p -= p&(-p);
}
return ssum;
}
ll query(int num,int s,int e,int l,int r)
{
return sum(r) - sum(l - 1);
}
int nextint()
{
char c;int ret;
while(isspace(c = getchar()))
;
ret = c - '0';
while((c = getchar()) >= '0' && c <= '9')
ret = ret * 10 + c - '0';
return ret;
}
int main()
{
int i,t;
//scanf("%d",&t);
t = nextint();
while(t --)
{
//scanf("%d",&n);
n = nextint();
memset(hash,-1,sizeof(hash));
for(i = 1;i <= n;i ++)
{
//scanf("%d",&lcm[i]);
lcm[i] = nextint();
}
m = nextint();
//scanf("%d",&m);
for(i = 0;i < m;i ++)
{
ask[i].l = nextint();
ask[i].r = nextint();
//scanf("%d%d",&ask[i].l,&ask[i].r);
ask[i].id = i + 1;
}
sort(ask,ask + m,cmp);
build(1,1,n);
int j = 1;
for(i = 0;i < m;)
{
if(j <= ask[i].r)
{
if(hash[lcm[j]] == -1)
{
insert(1,1,n,j,lcm[j]);
hash[lcm[j]] = j;//记录位置
}
else//已经插过lcm[j]了
{
insert(1,1,n,hash[lcm[j]],-lcm[j]);//删除
hash[lcm[j]] = j;//更新位置
insert(1,1,n,j,lcm[j]);
}
j ++;
}
else
{
ans[ask[i].id] = query(1,1,n,ask[i].l,ask[i].r);
i ++;
}
}
for(i = 1;i <= m;i ++)
printf("%I64d\n",ans[i]);
}
return 0;
}//1640MS 9912K
我擦,效率大涨啊啊啊啊,好神奇的字符串解析加速。。。