2017年2月25日
SPOJ UOFTCG - Office Mates （树的最小路径覆盖）
摘要： UOFTCG - Office Mates no tags no tags Dr. Baws has an interesting problem. His N Dr. Baws has an interesting problem. His N graduate students, while f 阅读全文
posted @ 2017-02-25 18:11 贱人方 阅读(311) 评论(0) 推荐(0)
SPOJ IITWPC4F - Gopu and the Grid Problem （双线段树区间修改 区间查询）
摘要： Gopu and the Grid Problem Gopu is interested in the integer co-ordinates of the X-Y plane (0<=x,y<=100000). Each integer coordinate contain a lamp, in 阅读全文
posted @ 2017-02-25 18:05 贱人方 阅读(304) 评论(0) 推荐(0)