11 2017 档案

摘要:题目链接:http://poj.org/problem?id=1651 Time Limit: 1000MS Memory Limit: 65536K Description The multiplication puzzle is played with a row of cards, each 阅读全文
posted @ 2017-11-24 20:27 Dilthey 阅读(187) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=3280 Time Limit: 2000MS Memory Limit: 65536K Description Keeping track of all the cows can be a tricky task so Farmer J 阅读全文
posted @ 2017-11-23 21:02 Dilthey 阅读(186) 评论(0) 推荐(0) 编辑
摘要:题目链接:https://cn.vjudge.net/problem/CodeForces-892A Jafar has n cans of cola. Each can is described by two integers: remaining volume of cola ai and ca 阅读全文
posted @ 2017-11-21 21:07 Dilthey 阅读(330) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=2955 Time Limit: 1000MS Memory Limit: 65536K Description We give the following inductive definition of a “regular brack 阅读全文
posted @ 2017-11-21 20:35 Dilthey 阅读(198) 评论(0) 推荐(0) 编辑
摘要:描述 CTG(Cun Tou Gaming) 是我校的一支 LOL 战队,他们参加比赛总是可以拿到冠军,因为每次都只有他们一支队伍参赛,所以只需要去签个到就可以直接夺冠并领取奖金。现在有 n 场比赛可以让他们选择,每场比赛都有各自的截止日期 d 和奖金 r ,而 CTG 战队必须在截止日期之前(包括 阅读全文
posted @ 2017-11-21 14:16 Dilthey 阅读(251) 评论(0) 推荐(0) 编辑
摘要:题目链接:https://cn.vjudge.net/problem/CodeForces-894C In a dream Marco met an elderly man with a pair of black glasses. The man told him the key to immor 阅读全文
posted @ 2017-11-20 22:35 Dilthey 阅读(683) 评论(0) 推荐(0) 编辑
摘要:题目链接:https://cn.vjudge.net/problem/CodeForces-894B Ralph has a magic field which is divided into n × m blocks. That is to say, there are n rows and m  阅读全文
posted @ 2017-11-20 21:31 Dilthey 阅读(789) 评论(0) 推荐(2) 编辑
摘要:题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1789 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Descripti 阅读全文
posted @ 2017-11-19 08:27 Dilthey 阅读(368) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=2187 Time Limit: 3000MS Memory Limit: 65536K Description Bessie, Farmer John's prize cow, has just won first place in a 阅读全文
posted @ 2017-11-16 22:42 Dilthey 阅读(387) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=1066 Time Limit: 1000MS Memory Limit: 10000K Description Archeologists from the Antiquities and Curios Museum (ACM) hav 阅读全文
posted @ 2017-11-14 20:38 Dilthey 阅读(244) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=2653 Time Limit: 3000MS Memory Limit: 65536K Description Stan has n sticks of various length. He throws them one at a t 阅读全文
posted @ 2017-11-14 20:00 Dilthey 阅读(300) 评论(0) 推荐(0) 编辑
摘要:这次CF不是很难,我这种弱鸡都能在半个小时内连A四道……不过E题没想到还有这种折半+状压枚举+二分的骚操作,后面就挂G了…… A.Local Extrema 题目链接:https://cn.vjudge.net/problem/CodeForces-888A You are given an arr 阅读全文
posted @ 2017-11-13 18:05 Dilthey 阅读(575) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=1556 Time Limit: 1000MS Memory Limit: 10000K Description You are to find the length of the shortest path through a cham 阅读全文
posted @ 2017-11-07 21:54 Dilthey 阅读(309) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=1269 Time Limit: 1000MS Memory Limit: 10000K Description We all know that a pair of distinct points on a plane defines 阅读全文
posted @ 2017-11-07 20:24 Dilthey 阅读(172) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3985 题意: 给出一个长度为n的字符串,全部由'C'和'P'组成; then,可以在原有字符串的基础上添加任意多个’C’或’P’,每次添加一个就要花费一些 $val 阅读全文
posted @ 2017-11-05 17:52 Dilthey 阅读(733) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3993 题意: 给出n幢建筑,每个都以一个点表示,给出点坐标。 有一个以原点为圆心,以R为半径的圆,记为圆O,是原始安全范围; then,安全范围变为在原来那个圆内任 阅读全文
posted @ 2017-11-05 17:45 Dilthey 阅读(640) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=2398 Time Limit: 1000MS Memory Limit: 65536K Description Mom and dad have a problem: their child, Reza, never puts his 阅读全文
posted @ 2017-11-03 19:36 Dilthey 阅读(272) 评论(0) 推荐(0) 编辑
摘要:题目链接:http://poj.org/problem?id=2318 Time Limit: 2000MS Memory Limit: 65536K Description Calculate the number of toys that land in each bin of a partit 阅读全文
posted @ 2017-11-01 16:41 Dilthey 阅读(355) 评论(0) 推荐(0) 编辑