上一页 1 ··· 6 7 8 9 10 11 12 13 下一页
摘要: DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular... 阅读全文
posted @ 2016-07-24 11:51 _Wilbert 阅读(153) 评论(0) 推荐(0) 编辑
摘要: Description未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名湖),每个湖泊Li里住着一只青蛙Fi(1 ≤ i ≤ N)。如果湖泊Li和Lj之间有水路相连,则青蛙Fi和Fj互称为邻居。现在已知每只青蛙的邻居数目x1, x2, ..., xn,请你给出每两个湖泊之间的相连... 阅读全文
posted @ 2016-07-24 11:00 _Wilbert 阅读(115) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionGive you a sequence of N(N≤100,000) integers : a1,...,an(0#include #include #include #include using namespace std;typedef long long... 阅读全文
posted @ 2016-07-21 23:13 _Wilbert 阅读(140) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionAn abandoned country has n(n≤100000) villages which are numbered from 1 to n. Since abandoned for a long time, the roads need to be... 阅读全文
posted @ 2016-07-21 19:59 _Wilbert 阅读(134) 评论(0) 推荐(0) 编辑
摘要: Description顺利潜入勺林寺几天后,方丈给了西瓜一个光荣而艰巨的任务——打扫寺庙中的道路。同时给了西瓜一张勺林寺的地图。西瓜这才知道,勺林寺中总共有n座房子,但道路只有n-1条,这n-1条道路连接了寺中的所有房子,即保证在任何两座房子都能沿着道路抵达。好在西瓜人缘不错,他知道每座房子中都有个... 阅读全文
posted @ 2016-07-20 15:09 _Wilbert 阅读(159) 评论(0) 推荐(0) 编辑
摘要: A tree is an undirected connected graph without cycles.Let's consider a rooted undirected tree with n vertices, numbered 1 through n. There are many w... 阅读全文
posted @ 2016-07-20 14:59 _Wilbert 阅读(122) 评论(0) 推荐(0) 编辑
摘要: Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: w... 阅读全文
posted @ 2016-07-20 14:55 _Wilbert 阅读(277) 评论(0) 推荐(0) 编辑
摘要: You are given a description of a depot. It is a rectangular checkered field of n × m size. Each cell in a field can be empty (".") or it can be occupi... 阅读全文
posted @ 2016-07-20 14:46 _Wilbert 阅读(160) 评论(0) 推荐(0) 编辑
摘要: There will be a launch of a new, powerful and unusual collider very soon, which located along a straight line. n particles will be launched inside it.... 阅读全文
posted @ 2016-07-20 14:41 _Wilbert 阅读(157) 评论(0) 推荐(0) 编辑
摘要: Palace Accepts: 28 Submissions: 307 Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)问题描述为了寻找失去的爱人Cupid,Psyche需要完成... 阅读全文
posted @ 2016-07-18 20:17 _Wilbert 阅读(175) 评论(0) 推荐(0) 编辑
上一页 1 ··· 6 7 8 9 10 11 12 13 下一页