Oops的博客

You Are the One Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4234    Accepted Submission(s): 1975 Problem Description 　　The TV shows

Play Game Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1606    Accepted Submission(s): 937 Problem Description Alice and Bob are pla

Palindrome subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65535 K (Java/Others) Total Submission(s): 3265    Accepted Submission(s): 1371 Problem Description In mat

http://acm.hdu.edu.cn/showproblem.php?pid=6365   题意:在二维平面的第一象限和第四象限上有 n 条线段表示 n 堵墙，每堵墙有一个坚固度 wi ，表示只有不小于 wi 的能量才能摧毁并贯穿它。你只能从原点向任意方向发射任意能量，问至少需要发射多少能量才能把所有的墙都摧毁。   思路： 将所有端点按极角序进行离散化，端点下标为1到2n。 设立...