我想去学习一下莫队,然后我获得了这道题.接下来我笑出声来了.
Uva 12345
#include<cstdio>
#define boss 1000000
int a[50101],cnt[boss+10],n,m;
int main()
{
int i,l,r,j;char c[5];
scanf("%d%d",&n,&m);
for (i=0;i<n;) scanf("%d",&a[i++]);
for (;m--;)
{
scanf("%s%d%d",c,&l,&r);
if (c[0]=='Q')
{
int ans=0;
for (j=l;j<r;) ans+=!cnt[a[j++]]++;
for (j=l;j<r;) cnt[a[j++]]--;
printf("%d\n",ans);
}
else a[l]=r;
}
}
时间4200ms,连卡常都不用.也许这题10s时限就是滑稽吧.等我以后会了莫队再回来见你.