ataraxia

窝只想一直陪着你~~

K - Jury Compromise POJ 1015 (动态规划 --难)

K - Jury Compromise Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1015 Description In Fro...

2015-04-28 16:59:20

阅读数:796

评论数:0

I Think I Need a Houseboat ZOJ(几何计算)

I Think I Need a Houseboat Time Limit: 2 Seconds Memory Limit: 65536 KB Fred Mapper is considering purchasing some land in Louisiana to build his ho...

2015-04-28 13:44:31

阅读数:502

评论数:0

Financial Management ZOJ1048(简单计算)

Financial Management Time Limit: 2 Seconds Memory Limit: 65536 KB Larry graduated this year and finally has a job. He's making a lot of money, but s...

2015-04-28 13:23:08

阅读数:836

评论数:0

Gridland ZOJ1037(规律)

Gridland Time Limit: 2 Seconds Memory Limit: 65536 KB Background For years, computer scientists have been trying to find efficient solutions t...

2015-04-28 13:13:44

阅读数:757

评论数:0

Code HDU 5212(容斥原理)

Code Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 202 Accepted Submission(s): 81 Problem D...

2015-04-27 22:05:25

阅读数:545

评论数:0

Mutiple HDU5211(筛法)

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 221 Accepted Submission(s): 156 Problem D...

2015-04-27 22:01:31

阅读数:578

评论数:0

Delete HDU5210 (模拟贪心)

Delete Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 207 Accepted Submission(s): 140 P...

2015-04-27 21:58:51

阅读数:744

评论数:0

L - Common Subsequence POJ 1458 (动态规划,LCS 最长公共子序列 )

L - Common Subsequence Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1458 Description A s...

2015-04-24 18:46:26

阅读数:434

评论数:0

J - FatMouse's Speed HDU 1160 (动态规划,最长上升子序列+路径输出)

J - FatMouse's Speed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1160 Description FatMouse b...

2015-04-24 18:18:26

阅读数:431

评论数:0

I - 最少拦截系统 HDU 1257

I - 最少拦截系统 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1257 Description 某国为了防御敌国的导弹袭击,发展出一种导...

2015-04-24 15:31:09

阅读数:420

评论数:0

H - Tickets HDU 1260 (动态规划)

H - Tickets Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1260 Description Jesus, what a ...

2015-04-23 22:01:01

阅读数:541

评论数:0

G - 免费馅饼 HDU 1176 (动态规划---数塔的变形 )

G - 免费馅饼 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1176 Description 都说天上不会掉馅饼,但有一天gam...

2015-04-23 20:41:19

阅读数:468

评论数:0

F - Piggy-Bank HDU 1114 (完全背包的变形+初始化细节)

F - Piggy-Bank Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1114 Description Before ACM ...

2015-04-23 14:01:12

阅读数:534

评论数:0

E - Super Jumping! Jumping! Jumping! HDU 1087 (基础动态规划)

E - Super Jumping! Jumping! Jumping! Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1087 De...

2015-04-23 13:09:34

阅读数:511

评论数:0

Negative and Positive (NP) ( Hash 维护 )

Negative and Positive (NP) Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2846 Accepted Subm...

2015-04-23 10:36:54

阅读数:515

评论数:0

#1032 : 最长回文子串 (Manacher算法)

这篇博文对Manacher讲的还不错 #1032 : 最长回文子串 时间限制:1000ms 单点时限:1000ms 内存限制:64MB 描述 小Hi和小Ho是一对好朋友,出生在信息化社会的他们对编程产生了莫大的兴趣,他们约定好互相帮助,在编程的学习道路上一同前进。 这...

2015-04-23 10:21:25

阅读数:583

评论数:0

D - Doing Homework HDU1074 ( 动态规划 + 状态压缩 )

D - Doing Homework Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1074 Description Ignatiu...

2015-04-22 20:23:56

阅读数:477

评论数:0

Problem 1567 - D - Sloth's Angry ( 递归+贪心)

Problem 1567 - D - Sloth's Angry Time Limit: 1000MS Memory Limit: 65536KB Total Submit: 326 Accepted: 113 Special Judge: No Description A forest...

2015-04-21 17:55:40

阅读数:451

评论数:0

1540: 第k大数 两个数组元素相乘后的第k大( 二分答案 + 输入输出优化 )

1540: 第k大数 Time Limit: 10 Sec Memory Limit: 128 MB Submit: 104 Solved: 6 [Submit][Status][Web Board] Description 有两个序列a,b,它们的长度分别为n和m,那么将两个序列中...

2015-04-19 19:20:47

阅读数:990

评论数:0

STL upper_bound(),lower_bound()函数的学习+自己的实现

STL里,这两个函数用于在有序的数组里找某个元素的位置,用法简单提一下upper_bound(begin,end,key),start是查找的起点,end是终点,key是关键值,lower_bound()用法一样,upper_bound()函数,返回第一个大于要找的值得位置(或者理解是这个元素的下...

2015-04-19 18:31:40

阅读数:702

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭