摘要:
poj3177Redundant PathsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8558Accepted:3712DescriptionIn order to get from one of the F (1 2 and 1 ... 阅读全文
摘要:
poj1815FriendshipTime Limit:2000MSMemory Limit:20000KTotal Submissions:8768Accepted:2462DescriptionIn modern society, each person has his own friends.... 阅读全文
摘要:
hdu3987Harry Potter notices some Death Eaters try to slip into Castle. The Death Eaters hide in the most depths of Forbidden Forest. Harry need stop t... 阅读全文
摘要:
旋转卡壳法求点集的最小覆盖矩形面积以及周长uva12307Problem HSmallest Enclosing RectangleThere are n points in 2D space. You're to find a smallest enclosing rectangle of the... 阅读全文
摘要:
poj2079TriangleTime Limit:3000MSMemory Limit:30000KTotal Submissions:8023Accepted:2368DescriptionGiven n distinct points on a plane, your task is to f... 阅读全文
摘要:
hdu1598find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3300Accepted ... 阅读全文