随笔分类 -  动态规划

摘要:题目链接: "http://poj.org/problem?id=3071" Football Time Limit: 1000MSMemory Limit: 65536K 问题描述 Consider a single elimination football tournament involvin 阅读全文
posted @ 2016-10-20 16:06 fenicnn 阅读(119) 评论(0) 推荐(0)
摘要:题目链接: "http://poj.org/problem?id=3744" Scout YYF I Time Limit: 1000MSMemory Limit: 65536K 问题描述 YYF is a couragous scout. Now he is on a dangerous miss 阅读全文
posted @ 2016-10-20 00:10 fenicnn 阅读(128) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=4336" Card Collector Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) 阅读全文
posted @ 2016-10-18 15:15 fenicnn 阅读(124) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=4418" Time travel Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) 问题描 阅读全文
posted @ 2016-10-18 14:06 fenicnn 阅读(210) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=2262" Where is the canteen Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/O 阅读全文
posted @ 2016-10-17 01:55 fenicnn 阅读(161) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=4035" Maze Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others) 问题描述 When 阅读全文
posted @ 2016-10-16 23:43 fenicnn 阅读(93) 评论(0) 推荐(0)
摘要:题目链接: "http://vjudge.net/problem/UVA 11021" Tribles Time Limit: 3000MS 题意 有k只麻球,每只活一天就会死亡,临死之前可能会出生一些新的麻球。生i个麻球的概率为pi,求m天后所有麻球死亡的概率。不足m天死光也算。 题解 每只麻球后 阅读全文
posted @ 2016-10-16 12:12 fenicnn 阅读(103) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=3853" LOOPS Time Limit: 15000/5000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others) 问题描述 Ak 阅读全文
posted @ 2016-10-15 23:31 fenicnn 阅读(135) 评论(0) 推荐(0)
摘要:题目链接: "http://poj.org/problem?id=2096" Collecting Bugs Time Limit: 10000MSMemory Limit: 64000K 问题描述 Ivan is fond of collecting. Unlike other people wh 阅读全文
posted @ 2016-10-15 22:05 fenicnn 阅读(148) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=4405" Aeroplane chess Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) 阅读全文
posted @ 2016-10-15 10:48 fenicnn 阅读(123) 评论(0) 推荐(0)
摘要:题目链接: "http://codeforces.com/problemset/problem/621/E" E. Wet Shark and Blocks time limit per test2 secondsmemory limit per test256 megabytes 问题描述 The 阅读全文
posted @ 2016-10-14 17:05 fenicnn 阅读(159) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=4616" Game Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others) 问题描述 Nowad 阅读全文
posted @ 2016-10-14 11:42 fenicnn 阅读(167) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=4126" Genghis Khan the Conqueror Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 327680/327680 K 阅读全文
posted @ 2016-10-13 10:37 fenicnn 阅读(242) 评论(0) 推荐(0)
摘要:题目链接: "http://codeforces.com/problemset/problem/337/D" D. Book of Evil time limit per test2 secondsmemory limit per test256 megabytes 问题描述 Paladin Man 阅读全文
posted @ 2016-10-13 01:23 fenicnn 阅读(167) 评论(0) 推荐(0)
摘要:题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=4123 Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) 问题描述 Bob wants t 阅读全文
posted @ 2016-10-11 11:25 fenicnn 阅读(135) 评论(0) 推荐(0)
摘要:题目链接: "http://acm.hdu.edu.cn/showproblem.php?pid=4514" 湫湫系列故事——设计风景线 Time Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) 问 阅读全文
posted @ 2016-10-11 00:39 fenicnn 阅读(166) 评论(0) 推荐(0)
摘要:题目链接: "http://poj.org/problem?id=1239" Increasing Sequences Time Limit: 1000MSMemory Limit: 10000K 问题描述 Given a string of digits, insert commas to cre 阅读全文
posted @ 2016-10-10 11:51 fenicnn 阅读(258) 评论(0) 推荐(0)
摘要:题目链接: "https://acm.bnu.edu.cn/v3/contest_show.php?cid=8506 problem/I" I. Increasing or Decreasing Case Time Limit: 1000msMemory Limit: 524288KB 题意 求[l 阅读全文
posted @ 2016-10-06 23:27 fenicnn 阅读(216) 评论(0) 推荐(0)
摘要:题目链接: "https://www.bnuoj.com/v3/problem_show.php?pid=52305" Around the World Time Limit: 20000msMemory Limit: 1048576KB 题意 给你一颗树,相邻两点间有2c条边,问以1为起点和终点的 阅读全文
posted @ 2016-10-04 11:53 fenicnn 阅读(201) 评论(0) 推荐(0)
摘要:题目链接: "http://bak.vjudge.net/problem/UVA 10635" Prince and Princess Time Limit: 3000MS 题意 给你两个数组,求他们的最长公共子串。 题解 每个数组的大小最大有62500,所以n^2的经典算法肯定行不通。 那么,我么 阅读全文
posted @ 2016-10-02 01:34 fenicnn 阅读(122) 评论(0) 推荐(0)