happy_codes - 博客园

2017年5月16日

摘要： Strange Optimization Accepted : 67 Submit : 289 Time Limit : 1000 MS Memory Limit : 65536 KB Strange Optimization Strange Optimization Bobo is facing 阅读全文

posted @ 2017-05-16 15:40 happy_codes 阅读(292) 评论(0) 推荐(0) 编辑

Highway

摘要： Highway Accepted : 78 Submit : 275 Time Limit : 4000 MS Memory Limit : 65536 KB Highway Highway In ICPCCamp there were n towns conveniently numbered w 阅读全文

posted @ 2017-05-16 15:34 happy_codes 阅读(218) 评论(0) 推荐(0) 编辑

Partial Sum

摘要： Partial Sum Accepted : 80 Submit : 353 Time Limit : 3000 MS Memory Limit : 65536 KB Partial Sum Partial Sum Bobo has a integer sequence a1,a2,…,an of 阅读全文

posted @ 2017-05-16 15:25 happy_codes 阅读(256) 评论(0) 推荐(0) 编辑

Super Resolution

摘要： Super Resolution Accepted : 121 Submit : 187 Time Limit : 1000 MS Memory Limit : 65536 KB Super Resolution Super Resolution Bobo has an n×m picture co 阅读全文

posted @ 2017-05-16 10:21 happy_codes 阅读(258) 评论(0) 推荐(0) 编辑

2017年5月11日

Sequence I

摘要： Sequence I (hdu 5918) Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1938 Accepted Submission(s 阅读全文

posted @ 2017-05-11 19:51 happy_codes 阅读(250) 评论(0) 推荐(0) 编辑

Harmonic Value Description(构造题)

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 786 Accepted Submission(s): 456Special Judge Pro 阅读全文

posted @ 2017-05-11 19:34 happy_codes 阅读(249) 评论(0) 推荐(0) 编辑

Triangle

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1057 Accepted Submission(s): 656 Problem Descrip 阅读全文

posted @ 2017-05-11 19:26 happy_codes 阅读(125) 评论(0) 推荐(0) 编辑

Fraction

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1010 Accepted Submission(s): 532 Problem Descrip 阅读全文

posted @ 2017-05-11 19:13 happy_codes 阅读(225) 评论(0) 推荐(0) 编辑

2017年5月10日

最大流

摘要：还是比较好理解的，看大白后一下就理解了，注释也写得很详细了，直接上模板吧 1 #include <iostream> 2 #include <cstdio> 3 #include <cstring> 4 #include <vector> 5 #include <queue> 6 7 using n 阅读全文

posted @ 2017-05-10 17:11 happy_codes 阅读(106) 评论(0) 推荐(0) 编辑

2017年5月9日

Happy Necklace(矩阵快速幂)

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 222 Accepted Submission(s): 91 Problem Descrip 阅读全文

posted @ 2017-05-09 21:00 happy_codes 阅读(317) 评论(0) 推荐(0) 编辑

Building Shops

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 379 Accepted Submission(s): 144 Problem Descri 阅读全文

posted @ 2017-05-09 15:57 happy_codes 阅读(257) 评论(0) 推荐(0) 编辑

2017年5月8日

Graph Theory

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 140 Accepted Submission(s): 74 Problem Descrip 阅读全文

posted @ 2017-05-08 21:07 happy_codes 阅读(242) 评论(0) 推荐(0) 编辑

Coprime Sequence

摘要： Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 217 Accepted Submission(s): 126 Problem Descri 阅读全文

posted @ 2017-05-08 19:51 happy_codes 阅读(302) 评论(0) 推荐(0) 编辑

2017年5月4日

Nearest Common Ancestors(LCA)

摘要： Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is l 阅读全文

posted @ 2017-05-04 20:43 happy_codes 阅读(175) 评论(0) 推荐(0) 编辑

2017年4月27日

K.Bro Sorting(思维题)

摘要： K.Bro Sorting Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3072 Accepted Submission(s): 1390 阅读全文

posted @ 2017-04-27 20:43 happy_codes 阅读(143) 评论(0) 推荐(0) 编辑

Intersection(计算几何)

摘要： Intersection Time Limit: 4000/4000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3018 Accepted Submission(s): 1135 阅读全文

posted @ 2017-04-27 20:32 happy_codes 阅读(275) 评论(0) 推荐(0) 编辑

Happy Matt Friends(DP)

摘要： Happy Matt Friends Time Limit: 6000/6000 MS (Java/Others) Memory Limit: 510000/510000 K (Java/Others)Total Submission(s): 3700 Accepted Submission(s): 阅读全文

posted @ 2017-04-27 20:21 happy_codes 阅读(171) 评论(0) 推荐(0) 编辑

Dire Wolf(区间DP)

摘要： Dire Wolf Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 2221 Accepted Submission(s): 1284 Pro 阅读全文

posted @ 2017-04-27 20:12 happy_codes 阅读(228) 评论(0) 推荐(0) 编辑

Black And White(DFS+剪枝)

摘要： Black And White Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 3937 Accepted Submission(s): 10 阅读全文

posted @ 2017-04-27 19:52 happy_codes 阅读(230) 评论(0) 推荐(0) 编辑

2017年4月22日

最大子矩阵

摘要：给你一个m×n的整数矩阵，在上面找一个x×y的子矩阵，使子矩阵中所有元素的和最大。 Input输入数据的第一行为一个正整数T，表示有T组测试数据。每一组测试数据的第一行为四个正整数m,n,x,y（0<m,n<1000 AND 0<x<=m AND 0<y<=n），表示给定的矩形有m行n列。接下来这个阅读全文

posted @ 2017-04-22 17:28 happy_codes 阅读(166) 评论(0) 推荐(0) 编辑

happy_code

公告