摘要:
先按s从小到大排序若相同再按E从大到小在点相同时要特殊处理View Code #include<cstdio>#include<iostream>#include<algorithm>using namespace std;int n;int tree[200009];int all[200009];int temp[200009];struct data{ int l,r; int no;}node[200009];int lowbit(int x){ return x&(-x);}void updata(int x,int c){ int i; 阅读全文
posted @ 2011-07-16 15:53 huhuuu 阅读(185) 评论(0) 推荐(0) 编辑