代码:一直TLE,,,,
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<memory.h>
using namespace std;
const int MAX=110000;
struct node
{
int left,right;
int sum;
}tree[MAX*4];
void build(int T,int L,int R)
{
tree[T].left=L;
tree[T].right=R;
if(L==R)
{
tree[T].sum=1;
return;
}
int mid=(L+R)/2;
build(T*2,L,mid);
build(T*2+1,mid+1,R);
tree[T].sum=tree[T*2].sum+tree[T*2+1].sum;
}
void UpDate(int T,int L,int R,int LL,int RR,int value)
{
//printf("T=%d* L=%d,R=%d,LL=%d,RR=%d,value=%d\n",T,L,R,LL,RR,value);
/*if(T<0)
return ;*/
if(L==LL&&R==RR)
{
tree[T].sum=value*(R-L+1);
//return;
if(LL!=RR)//更新子节点
{
int mid=(L+R)/2;
UpDate(T*2,L,mid,LL,mid,value);
UpDate(T*2+1,mid+1,R,mid+1,RR,value);
}
}
else
{
int mid=(L+R)/2;
if(RR<=mid)
{
UpDate(T*2,L,mid,LL,RR,value);
//return;
}
else if(LL>mid)//LL>=mid,,,错了
{
UpDate(T*2+1,mid+1,R,LL,RR,value);
//return;
}
else
{
UpDate(T*2,L,mid,LL,mid,value);
UpDate(T*2+1,mid+1,R,mid+1,RR,value);
}
tree[T].sum=tree[T*2].sum+tree[T*2+1].sum;
}
//tree[T].sum=tree[T*2].sum+tree[T*2+1].sum;//错了一次
//printf("tree[%d].sum=%d----\n",T,tree[T].sum);
}
int main()
{
int ca;
scanf("%d",&ca);
int N,Q;
for(int t=1;t<=ca;t++)
{
scanf("%d %d",&N,&Q);
build(1,1,N);
//printf("%d*****\n\n",tree[1].sum);
int x,y,z;
for(int i=1;i<=Q;i++)
{
scanf("%d %d %d",&x,&y,&z);
UpDate(1,1,N,x,y,z);
}
int ans=tree[1].sum;
printf("Case %d: The total value of the hook is %d.\n",t,ans);
}
//system("pause");
return 0;
}
/*
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<memory.h>
using namespace std;
const int MAX=110000;
struct node
{
int left,right;
int sum;
}tree[MAX*4];
void build(int T,int L,int R)
{
tree[T].left=L;
tree[T].right=R;
if(L==R)
{
tree[T].sum=1;
return;
}
int mid=(L+R)/2;
build(T*2,L,mid);
build(T*2+1,mid+1,R);
tree[T].sum=tree[T*2].sum+tree[T*2+1].sum;
}
void UpDate(int T,int L,int R,int LL,int RR,int value)
{
//printf("T=%d* L=%d,R=%d,LL=%d,RR=%d,value=%d\n",T,L,R,LL,RR,value);
if(T<0)
return ;
if(L==LL&&R==RR)//错在没有更新叶子节点
{
tree[T].sum=value*(R-L+1);
//return;
}
else
{
int mid=(L+R)/2;
if(RR<=mid)
{
UpDate(T*2,L,mid,LL,RR,value);
//return;
}
else if(LL>mid)//LL>=mid,,,错了
{
UpDate(T*2+1,mid+1,R,LL,RR,value);
//return;
}
else
{
UpDate(T*2,L,mid,LL,mid,value);
UpDate(T*2+1,mid+1,R,mid+1,RR,value);
}
}
tree[T].sum=tree[T*2].sum+tree[T*2+1].sum;
printf("tree[%d].sum=%d----\n",T,tree[T].sum);
}
int main()
{
int ca;
scanf("%d",&ca);
int N,Q;
for(int t=1;t<=ca;t++)
{
scanf("%d %d",&N,&Q);
build(1,1,N);
//printf("%d*****\n\n",tree[1].sum);
int x,y,z;
for(int i=1;i<=Q;i++)
{
scanf("%d %d %d",&x,&y,&z);
UpDate(1,1,N,x,y,z);
}
int ans=tree[1].sum;
printf("Case %d: The total value of the hook is %d.\n",t,ans);
}
system("pause");
return 0;
}
*/