#include <iostream>
#include <stdio.h>
#include <string.h>
#include <set>
#include <algorithm>
#define ls t<<1
#define rs t<<1|1
#define midt(tr[t].l+tr[t].r)>>1
#define ll long long
using namespace std;
const int maxn=40000+10;
int x[maxn<<1];
set<int> xx;
struct data
{
int a,b,h;
bool operator<(const data &xx) const
{
return(h<xx.h);
}
}d[maxn];
struct
{
int l,r;
ll a,b,sum;
int lazy;
}tr[maxn<<3];
void maketree(int t,int l,int r)
{
tr[t].l=l;
tr[t].r=r;
tr[t].a=x[l];
tr[t].b=x[r];
tr[t].lazy=0;
tr[t].sum=x[r]-x[l];
// printf("%lld\n",tr[t].sum);
if(l+1==r) return;
int mid=midt;
maketree(ls,l,mid);
maketree(rs,mid,r);
}
void pushdown(int t)
{
tr[ls].lazy=tr[t].lazy;
tr[rs].lazy=tr[t].lazy;
tr[ls].sum=0;
tr[rs].sum=0;
tr[t].lazy=0;
}
void modify(int t,int a,int b)
{
if(a<=tr[t].a&&b>=tr[t].b)
{
tr[t].sum=0;
tr[t].lazy=1;
return;
}
if(tr[t].lazy)
pushdown(t);
int mid=midt;
if(a<x[mid]) modify(ls,a,b);
if(x[mid]<b) modify(rs,a,b);
tr[t].sum=tr[ls].sum+tr[rs].sum;
}
ll query(int t,int a,int b)
{
if(a<=tr[t].a&&b>=tr[t].b)
return(tr[t].sum);
int mid=midt;
if(tr[t].lazy)
pushdown(t);
ll ret=0;
if(a<x[mid]) ret+=query(ls,a,b);
if(x[mid]<b) ret+=query(rs,a,b);
return(ret);
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
xx.clear();
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&d[i].a,&d[i].b,&d[i].h);
xx.insert(d[i].a);
xx.insert(d[i].b);
}
int j=0;
for(set<int>::iteratori=xx.begin();i!=xx.end();i++)
x[++j]=*i;
sort(d+1,d+1+n);
maketree(1,1,j);
ll ans=0;
for(int i=n;i>=1;i--)
{
ans+=query(1,d[i].a,d[i].b)*d[i].h;
modify(1,d[i].a,d[i].b);
}
printf("%lld\n",ans);
}
return 0;
}
poj 3277 City Horizon 线段树
最新推荐文章于 2017-07-17 12:57:41 发布