对于给定区间利用线段树进行维护,在Q次修改之后,进行n次查询,将每一位的值加起来即为结果。没有什么坑点。
#include<iostream>
using namespace std;
const int maxn = 1e5+5;
int segment[4*maxn];
int n;
void pushdown(int i)
{
if(segment[i])
{
segment[i<<1] = segment[i];
segment[i<<1|1] = segment[i];
segment[i] = 0;
}
}
void build(int i,int l,int r)
{
if(l == r)
{
segment[i] = 1;
return;
}
int mid = (l + r) >> 1;
build(i<<1,l,mid);
build(i<<1|1,mid+1,r);
}
void update(int i,int val,int ql,int qr,int l,int r)
{
if(ql > r || qr < l) return;
if(ql <= l && qr >= r)
{
segment[i] = val;
return;
}
pushdown(i);
int mid = (l + r) >> 1;
update(i<<1,val,ql,qr,l,mid);
update(i<<1|1,val,ql,qr,mid+1,r);
}
int query(int i,int x,int l,int r)
{
if(l == r) return segment[i];
pushdown(i);
int mid = (l + r) >> 1;
if(x <= mid)
return query(i<<1,x,l,mid);
else
return query(i<<1|1,x,mid+1,r);
}
int solve()
{
int res = 0;
for(int i = 1;i <= n;++i)
res += query(1,i,1,n);
return res;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);cout.tie(NULL);
int t,m;
cin>>t;
for(int test = 1;test <= t;++test)
{
cin>>n>>m;
build(1,1,n);
int a,b,c;
for(int i = 1;i <= m;++i)
{
cin>>a>>b>>c;
update(1,c,a,b,1,n);
}
cout<<"Case "<<test<<": The total value of the hook is "<<solve()<<"."<<endl;
}
return 0;
}