poj-2352-Stars-线段树

很裸的单点更新线段树

#include
  
   
#include
   
     #include
    
      #include
     
       using namespace std; #define maxn 110000 struct list { int l,r; int x; }node[maxn*6]; struct listt { int x,y; bool friend operator < (const listt a, const listt b) { if(a.x!=b.x)return a.x
      
       x||r
       
        r||rr