Qiuqiqiu |
|
||
不管道路多么崎岖坎坷,我永远不停下追逐梦想的脚步! |
2012年3月1日
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=1542面积并#include <cstdio>#include <algorithm>using namespace std;const int N=210;struct segment{ double x1,x2,y; int d; segment(){} segment(double _x1,double _x2,double _y,int _d) :x1(_x1),x2(_x2),y(_y),d(_d){} bool operator < (const segment... 阅读全文
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=1540View Code 1 //HDU 1540 2 #include <cstdio> 3 using namespace std; 4 const int N=50010; 5 struct segtree 6 { 7 int l,r,ls,rs; 8 int m() {return (l+r)/2;} 9 int len() {return r-l+1;}10 }st[N*4];11 int des[N];12 void pushup(int rt)13 {14 in... 阅读全文
|
Copyright © 2024 Qiuqiqiu
Powered by .NET 9.0 on Kubernetes |