线段树的简单应用；火车订票；线段树用起来太灵活了！；

#include <iostream> using namespace std; #define MAX 16000 int left_child[MAX],right_child[MAX],left_bound[MAX],right_bound[MAX],seat[MAX],bj[MAX]; int node=0,res[MAX],num; void clear(int index) { seat[index]+=bj[index]; bj[left_child[index]]+=bj[index]; bj[right_child[index]]+=bj[index]; bj[index]=0; } void construct(int left,int right) { int index; ++node; index=node; left_bound[index]=left; right_bound[index]=right; seat[index]=num; bj[index]=0; if(left+1<right) { int mid=(left+right)/2; left_child[index]=node+1; construct(left,mid); right_child[index]=node+1; construct(mid,right); } } bool can(int index,int left,int right,int req) { if(bj[index]!=0) { clear(index); } if(left_bound[index]==left&&right_bound[index]==right) { if(seat[index]>=req) { return true; } else { return false; } } int mid=(left_bound[index]+right_bound[index])/2; if(left<mid&&right<=mid) { return can(left_child[index],left,right,req); } if(left<mid&&right>mid) { return can(left_child[index],left,mid,req)&&can(right_child[index],mid,right,req); } //if(left>=mid&&right>mid) // { return can(right_child[index],left,right,req); // } } void _delete(int index,int left,int right,int req) { if(bj[index]!=0) { clear(index); } if(left==left_bound[index]&&right==right_bound[index]) { seat[index]-=req; bj[left_child[index]]-=req; bj[right_child[index]]-=req; return; } int mid=(left_bound[index]+right_bound[index])/2; if(left<mid&&right<=mid) { _delete(left_child[index],left,right,req); clear(right_child[index]); } if(left<mid&&right>mid) { _delete(left_child[index],left,mid,req); _delete(right_child[index],mid,right,req); } if(left>=mid&&right>mid) { _delete(right_child[index],left,right,req); clear(left_child[index]); } seat[index]=seat[left_child[index]]<=seat[right_child[index]]? seat[left_child[index]]:seat[right_child[index]]; } int main() { node=0; memset(left_child,0,sizeof(left_child)); memset(left_child,0,sizeof(right_child)); int left,right,req,n,r; cin>>n>>num>>r; construct(1,n); for(int i=1;i<=r;++r) { cin>>left>>right>>req; if(can(1,left,right,req)==true) { cout<<"T"<<endl; _delete(1,left,right,req); } else { cout<<"F"<<endl; } } }

 

题目描述： 一条火车线路一共n个站，然后用户可以订任何两段之间的票，用线段树就能解决这个问题.

 

如果某一段完全覆盖,并且票数足够订购,那么把这个顶点的票减去,并且修改孩子结点标志域,通知他们各自的票数也应该减去.

如果没有完全覆盖,那么需要根据情况分别递归左右孩子订票,当前结点的票数等于子结点订票完成后的最小值.