摘要: DartsTime Limit:1000MSMemory Limit:65536KTotal Submissions:58Accepted:32Special JudgeDescriptionAfter a long week of work at the ICPC Headquarters, Bi... 阅读全文
posted @ 2014-08-24 00:17 一个大叔 阅读(291) 评论(0) 推荐(0) 编辑
摘要: DescriptionYou have an arraya[1], a[2], ..., a[n], containing distinct integers from1ton. Your task is to sort this array in increasing order with the... 阅读全文
posted @ 2014-07-26 12:30 一个大叔 阅读(410) 评论(0) 推荐(0) 编辑
摘要: DescriptionThere is a number of disjoint vertical line segments in the plane. We say that two segments are horizontally visible if they can be connect... 阅读全文
posted @ 2014-07-19 23:34 一个大叔 阅读(677) 评论(0) 推荐(0) 编辑
摘要: DescriptionYou haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each ... 阅读全文
posted @ 2014-07-18 14:42 一个大叔 阅读(140) 评论(0) 推荐(0) 编辑
摘要: DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year ... 阅读全文
posted @ 2014-07-18 14:40 一个大叔 阅读(194) 评论(0) 推荐(0) 编辑
摘要: 一。從命令到編輯模式a :当前单词后面插入Appendi :当前位置插入Inserto :当前行下新开一行插入Open new lineA :当前行尾插入AppendI :当前行首插入InsertO :当前行上新开一行插入Open new line比較常用就是i,a,o,I,A,O了,將來多試幾次就... 阅读全文
posted @ 2014-07-15 14:20 一个大叔 阅读(203) 评论(0) 推荐(0) 编辑
摘要: DescriptionYou are given a sequence ofnintegersa1, a2, ... , anin non-decreasing order. In addition to that, you are given several queries consisting ... 阅读全文
posted @ 2014-07-14 22:14 一个大叔 阅读(127) 评论(0) 推荐(0) 编辑
摘要: DescriptionN(3 7 #include 8 #include 9 using namespace std;10 11 #define maxv 10000512 #define maxn 2000513 typedef long long LL;14 15 int c[maxv],n,v... 阅读全文
posted @ 2014-07-14 20:11 一个大叔 阅读(224) 评论(0) 推荐(0) 编辑
摘要: DescriptionNchildren are playing Rochambeau (scissors-rock-cloth) game with you. One of them is the judge. The rest children are divided into three gr... 阅读全文
posted @ 2014-07-12 20:02 一个大叔 阅读(189) 评论(0) 推荐(0) 编辑
摘要: DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out ... 阅读全文
posted @ 2014-07-11 16:02 一个大叔 阅读(177) 评论(0) 推荐(0) 编辑