04 2015 档案

SCAU_WeiShenWahle 之省赛任务
摘要：每一项按顺序理解之后裸敲，每个代码最多15分钟，用模板题来测，超过15分钟算未理解线段树平衡树（ Treap , sbt , spt ）#include #include using namespace std ;const int N = 1000010 ;struct node { int... 阅读全文
posted @ 2015-04-28 22:36 hl_mark 阅读(227) 评论(0) 推荐(0)
Topcoder SRM656div1 250 ( 期望DP )
摘要：Problem StatementCharlie has N pancakes. He wants to serve some of them for breakfast. We will number the pancakes 0 through N-1. For each i, pancake ... 阅读全文
posted @ 2015-04-17 23:52 hl_mark 阅读(256) 评论(0) 推荐(0)
SCAU 2015 GDCPC team_training1
摘要：A:http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1525题意：前两段都是废话 ， 然后给出一个 p( p(a) ) = p(a) 的公式给你 ， 符合这个公式的1~n序列属于idempotent , 题目就问有多少个是 non -idempote... 阅读全文
posted @ 2015-04-15 13:45 hl_mark 阅读(346) 评论(0) 推荐(0)
第五次群赛暨清明节专场
摘要：题目链接：http://www.kuangbinoj.com:8080/contest.php?cid=1007在ACM交流群的第一场群赛，感觉题目还是不错的。A : 给出一个 1元1次方程 ， 求解算是一个模拟题，我做法是将其化成 k1*x + c1 = k2 * x + c2 的形式注意下 。 ... 阅读全文
posted @ 2015-04-06 01:39 hl_mark 阅读(202) 评论(0) 推荐(0)
HDU 2783 You’ll be Working on the Railroad（最短路）
摘要：You’ll be Working on the RailroadTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 246Accepted Submi... 阅读全文
posted @ 2015-04-06 01:12 hl_mark 阅读(329) 评论(0) 推荐(0)
HDU 4013 Distinct Subtrees(树的最小表示)
摘要：Distinct SubtreesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 391Accepted Submission(s): 190Pr... 阅读全文
posted @ 2015-04-03 11:20 hl_mark 阅读(546) 评论(0) 推荐(1)
HDU 4014 Jimmy’s travel plan(图计数)
摘要：Jimmy’s travel planTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 341Accepted Submission(s): 58P... 阅读全文
posted @ 2015-04-03 11:07 hl_mark 阅读(344) 评论(0) 推荐(0)