06 2018 档案
摘要:As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers ar
阅读全文
摘要:As you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. ...
阅读全文
摘要:The Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng51...
阅读全文
摘要:Prim 邻接矩阵版:#define INF 0x3f3f3f3fconst int MAXN = 105;int N;int map[MAXN][MAXN];bool book[MAXN];//true为已经加入树的,false则相反 int lenth[MAXN]...
阅读全文
摘要:N个点M条边的无向连通图,每条边有一个权值,求该图的最小生成树。Input第1行:2个数N,M中间用空格分隔,N为点的数量,M为边的数量。(2 #include #include #include using namespace std;const int MAXN ...
阅读全文
摘要:在过三个礼拜,YellowStar有一场专业英语考试,因此它必须着手开始复习。 这天,YellowStar准备了n个需要背的单词,每个单词的长度均为m。 YellowSatr准备采用联想记忆法来背诵这n个单词: 1、如果YellowStar凭空背下一个新词T,需要消...
阅读全文
摘要:There are N, 1 ,rectangle 2: ,rectangle 3: .The total area of all simple polygons constructed by these rectangles is 18. InputThe inpu...
阅读全文
摘要:A number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical o...
阅读全文
摘要:有一口井,井的高度为N,每隔1个单位它的宽度有变化。现在从井口往下面扔圆盘,如果圆盘的宽度大于井在某个高度的宽度,则圆盘被卡住(恰好等于的话会下去)。 盘子有几种命运:1、掉到井底。2、被卡住。3、落到别的盘子上方。 盘子的高度也是单位高度。给定井的宽度和每个盘子的...
阅读全文
摘要:头文件:#include 时间复杂度:一次查询O(log n),n为数组长度。图示:lower_bound:功能:查找非递减序列[first,last) 内第一个大于或等于某个元素的位置。返回值:如果找到返回找到元素的地址否则返回last的地址。(这样不注意的话会越界...
阅读全文
摘要:ime limit per test: 1 secondmemory limit per test: 256 megabytesinput: standard inputoutput: standard outputThis is an interactive pro...
阅读全文
摘要:给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个正整数T(11)就行了。代码:#include using namespace std;const int MAXN = 2005;struct Node{ double ...
阅读全文
摘要:There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps o...
阅读全文
摘要:/*二分查找,找到该值在数组中的下标,否则为-1*/int binarySerach(int array[] , int length , int key) { int left = 1; int right = length; // 这里必须是 <...
阅读全文
摘要:Time limit 8000 msMemory limit 65536 kB Yuanfang is puzzled with the question below: T...
阅读全文