摘要：
Computer TransformationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6084Accepted Submission(s):... 阅读全文
posted @ 2014-11-25 17:04
哈特13
阅读(383)
评论(0)
推荐(0)
摘要：
LCISTime Limit: 6000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4437Accepted Submission(s): 2006Problem Descri... 阅读全文
posted @ 2014-11-24 23:33
哈特13
阅读(184)
评论(0)
推荐(0)
摘要：
敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 46775Accepted Submission(s): 19828Problem Desc... 阅读全文
posted @ 2014-11-24 23:01
哈特13
阅读(216)
评论(0)
推荐(0)
摘要：
平方和总时间限制:3000ms内存限制:65536kB描述给出n(1#include#includeusing namespace std;#define N 500005#define ll long longll add[N>1; add[rt>1; build(l,m,rt... 阅读全文
posted @ 2014-11-24 22:58
哈特13
阅读(255)
评论(0)
推荐(0)
摘要：
回文字符串时间限制：3000ms | 内存限制：65535KB难度：4描述所谓回文字符串，就是一个字符串，从左到右读和从右到左读是完全一样的，比如"aba"。当然，我们给你的问题不会再简单到判断一个字符串是不是回文字符串。现在要求你，给你一个字符串，可在任意位置添加字符，最少再添加几个字符，可以使这... 阅读全文
posted @ 2014-11-24 21:29
哈特13
阅读(146)
评论(0)
推荐(0)
摘要：
统计难题Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 19054Accepted Submission(s): 8418Problem Desc... 阅读全文
posted @ 2014-11-24 17:25
哈特13
阅读(167)
评论(0)
推荐(0)
摘要：
Housewife WindDescriptionAfter their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village l... 阅读全文
posted @ 2014-11-24 14:17
哈特13
阅读(239)
评论(0)
推荐(0)
摘要：
TreeDescriptionYou are given a tree withNnodes. The tree’s nodes are numbered 1 throughNand its edges are numbered 1 throughN− 1. Each edge is associa... 阅读全文
posted @ 2014-11-24 13:22
哈特13
阅读(153)
评论(0)
推荐(0)
摘要：
B-numberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2668 Accepted Submission(s): 1467Problem... 阅读全文
posted @ 2014-11-22 17:15
哈特13
阅读(210)
评论(0)
推荐(0)
摘要：
The Unique MSTDescriptionGiven a connected undirected graph, tell if its minimum spanning tree is unique.Definition 1 (Spanning Tree): Consider a conn... 阅读全文
posted @ 2014-11-20 12:26
哈特13
阅读(196)
评论(0)
推荐(0)
浙公网安备 33010602011771号