随笔分类 -  简单题

摘要:地址:http://hihocoder.com/problemset/problem/1477 题目: 闰秒 闰秒 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 计算机系统中使用的UTC时间基于原子钟,这种计时方式同“地球自转一周是24小时”的计时方式有微小的偏差。为 阅读全文
posted @ 2017-03-13 10:07 weeping 阅读(292) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/782/problem/D 题目: D. Innokenty and a Football League time limit per test 2 seconds memory limit per test 256 megabyte 阅读全文
posted @ 2017-03-07 20:03 weeping 阅读(244) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/782/problem/C 题目: C. Andryusha and Colored Balloons time limit per test 2 seconds memory limit per test 256 megabytes 阅读全文
posted @ 2017-03-07 19:42 weeping 阅读(130) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/782/problem/B 题目: B. The Meeting Place Cannot Be Changed time limit per test 5 seconds memory limit per test 256 mega 阅读全文
posted @ 2017-03-07 19:38 weeping 阅读(80) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/782/problem/A 题目: A. Andryusha and Socks time limit per test 2 seconds memory limit per test 256 megabytes input stan 阅读全文
posted @ 2017-03-07 19:35 weeping 阅读(217) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/768/problem/B 题目: B. Code For 1 time limit per test 2 seconds memory limit per test 256 megabytes input standard inpu 阅读全文
posted @ 2017-02-21 19:49 weeping 阅读(303) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/problemset/problem/768/A 题目: A. Oath of the Night's Watch time limit per test 2 seconds memory limit per test 256 megabytes i 阅读全文
posted @ 2017-02-21 19:43 weeping 阅读(210) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/765/problem/C 题目: C. Table Tennis Game 2 time limit per test 2 seconds memory limit per test 512 megabytes input stan 阅读全文
posted @ 2017-02-20 19:04 weeping 阅读(217) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/765/problem/B 题目: B. Code obfuscation time limit per test 2 seconds memory limit per test 512 megabytes input standar 阅读全文
posted @ 2017-02-20 18:52 weeping 阅读(122) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/765/problem/A 题目: A. Neverending competitions time limit per test 2 seconds memory limit per test 512 megabytes input 阅读全文
posted @ 2017-02-20 18:50 weeping 阅读(116) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/766/problem/A A题: A. Mahmoud and Longest Uncommon Subsequence time limit per test 2 seconds memory limit per test 256 阅读全文
posted @ 2017-02-20 12:47 weeping 阅读(197) 评论(0) 推荐(0)
摘要:题目: Mars was the first planet colonized by humans. After a long terraforming process its appearance has changed completely. From the red desert it has 阅读全文
posted @ 2017-02-09 20:11 weeping 阅读(144) 评论(0) 推荐(0)
摘要:题目: Nowadays spaceships are never launched from the Earth's surface. There is a huge spaceport placed in the geostationary orbit and connected to the 阅读全文
posted @ 2017-02-09 20:09 weeping 阅读(214) 评论(0) 推荐(0)
摘要:题目: Faulty dial Pavel has not played ACM for ages, nor does he train teams, nor prepare problems. The thing is that there are much more global issues 阅读全文
posted @ 2017-02-07 17:27 weeping 阅读(154) 评论(0) 推荐(0)
摘要:题目: Bowling game In all asocial teams members ignore each other uniformly, each tight-knit team builds up team spirit their own way. Olya, Egor and Ol 阅读全文
posted @ 2017-02-07 17:22 weeping 阅读(325) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/764/problem/C 题目: C. Timofey and a tree time limit per test 2 seconds memory limit per test 256 megabytes input stand 阅读全文
posted @ 2017-02-03 13:15 weeping 阅读(221) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/contest/764/problem/B 题目: B. Timofey and cubes time limit per test 1 second memory limit per test 256 megabytes input standar 阅读全文
posted @ 2017-02-03 13:05 weeping 阅读(214) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/problemset/problem/712/C 题目: C. Memory and De-Evolution time limit per test 2 seconds memory limit per test 256 megabytes inp 阅读全文
posted @ 2016-09-13 18:40 weeping 阅读(166) 评论(0) 推荐(0)
摘要:地址:http://codeforces.com/problemset/problem/712/B 题目: B. Memory and Trident time limit per test 2 seconds memory limit per test 256 megabytes input st 阅读全文
posted @ 2016-09-13 13:03 weeping 阅读(164) 评论(0) 推荐(0)
摘要:思路: 简单模拟下。从左向右扫描一次,求出挖出该区间空地的花费,并取个最小值即可。 至于怎么求区间内的高度最小值,就用线段树就好了。 阅读全文
posted @ 2016-08-03 23:05 weeping 阅读(239) 评论(0) 推荐(0)