二分
Electrodeless_key
这个作者很懒,什么都没留下…
展开
-
Codeforces 812C Sagheer and Nubian Market
二分买的产品的数量,排序,最小cost,简单题。#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <string>#include <vector>#include <stack>#include <bitset>#include <cstdlib>#include原创 2017-09-26 15:09:56 · 333 阅读 · 0 评论 -
Hacker, pack your bags! CodeForces - 822C
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>#include <string>#include <vector>#include <stack>#include <bitset>#include <cstdlib>#include <cmath>#include <set>#原创 2017-10-11 10:36:08 · 487 阅读 · 0 评论 -
codeforces883I 2017-2018 ACM-ICPC, NEERC, Southern Subregional Contest (Online Mirror, ACM-ICPC Rule
这题还是不错的,题目条件很容易想到是二分答案去做,大于k的集合的划分为了满足一个最小化最大值,这是一个二分的条件。问题是怎么check,在下只想出了笨办法,n的遍历再更新线段树,所以总共nlogn91og10,肯定是可以做的,但是烦。能很快想出dp的做法也是本事。#include <cstdio>#include <cstring>#include <algorithm>#include <原创 2017-11-01 19:37:12 · 474 阅读 · 0 评论