二分
newhonor
可以不伟大,但不能卑微
展开
-
J. The Parade
http://codeforces.com/contest/1250/problem/J#include <bits/stdc++.h>//#include <queue>//#include <cmath>//#include <iostream>//#include <unordered_map>#define ls...原创 2019-11-06 23:03:03 · 235 阅读 · 0 评论 -
C. Save the Nature
http://codeforces.com/contest/1241/problem/C#include <bits/stdc++.h>//#include <queue>//#include <cmath>//#include <iostream>//#include <unordered_map>#define l...原创 2019-11-04 20:51:51 · 340 阅读 · 0 评论 -
Jumbled String Gym - 101933J
https://vjudge.net/problem/Gym-101933J#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#include &...原创 2019-10-03 10:00:34 · 116 阅读 · 0 评论 -
K. Video Reviews
http://codeforces.com/gym/101755/problem/K#include <iostream>#include <cstring>#include <queue>#include <vector>#include <algorithm>#include <cstdio>#inclu...原创 2019-10-02 10:30:19 · 156 阅读 · 0 评论 -
区间价值 HihoCoder - 1483
https://cn.vjudge.net/problem/HihoCoder-1483思路:二分第k小值;尺取比该值小的区间val数量;#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <queue>...原创 2019-08-08 22:26:47 · 100 阅读 · 0 评论 -
L - Largest Allowed Area
https://cn.vjudge.net/contest/296345#problem/L思路:求最大子矩阵;1:二分,关闭同步流都会tle。。只能输入挂;2:单调 队列,在上一个方阵下减多一行一列还是合法,再从该点延申#include<algorithm>#include<set>#include<cmath>#include<cstr...原创 2019-07-11 21:58:44 · 180 阅读 · 0 评论 -
P1577 切绳子
https://www.luogu.org/problemnew/show/P1577反思:精度问题0.653=0.65,0.659=0.65向上取(1)转换为字符串;(2)乘精度再除, 要判断mid==0,不然判断会除0#include<algorithm>#include<set>#include<cmath>#include<c...原创 2019-07-07 22:11:17 · 258 阅读 · 0 评论 -
无交集的圆
https://ac.nowcoder.com/acm/contest/911/F思路:就是线段相交,1、排序枚举右端点找有多少左端点大于它的,upperbound;2、树状数组维护数量,主要查找是左区间-1#include<algorithm>#include<set>#include<queue>#include<cmath>#...原创 2019-06-04 16:03:45 · 161 阅读 · 0 评论 -
大吉大利
https://ac.nowcoder.com/acm/contest/911/I思路:二分答案;#include <bits/stdc++.h>#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)#define IT set<node>::iterator#define me...原创 2019-06-03 22:43:49 · 172 阅读 · 0 评论 -
Icebound and Sequence
https://ac.nowcoder.com/acm/contest/903/B题意:总结:递归二分求幂,递归求等比数列!#include<algorithm>#include<set>#include<queue>#include<cmath>#include<cstring>#include<iostr...原创 2019-05-26 11:26:18 · 324 阅读 · 0 评论 -
Black & White
https://ac.nowcoder.com/acm/contest/893/F题意:一串01串,m次修改;使得连续0或1最长,问最长多长;思路:(1)二分长度判断是否m次能完成;处理前缀和尺取判断区间;(2) 直接尺取0或1;#include<algorithm>#include<set>#include<queue>#includ...原创 2019-05-07 19:49:09 · 148 阅读 · 0 评论 -
C. Vasya and Robot
https://codeforc.es/contest/1073/problem/C题意:给一串命令;问是否到达终点(x,y);可以改变任意字串的命令,改变长度为最远的-最近的+1;问最小的长度,或者不行就-1;思路:记录x轴的前缀和和y轴的前缀和,二分长度然后尺取如果len和区间外的步数满奇偶相同和小于len就行;奇偶相同保证不会多出一步不能抵消;#include<algor...原创 2019-05-06 23:06:28 · 212 阅读 · 0 评论 -
Tree
https://ac.nowcoder.com/acm/contest/560/I题意:给一棵树分成k部分,是的每部分节点的权总和最小的最大;思路:二分每部分的权和,看能分出来的部分是否符合k;反思:二分的思想不够强啊!割一条边分开的就是这个根的权加上它字节的的权!#include<algorithm>#include<set>#include<...原创 2019-04-13 20:22:39 · 85 阅读 · 0 评论 -
A. Coffee Break
http://codeforces.com/gym/101911/problem/A题意:要喝n杯咖啡,且要在ai分钟喝,一天长m,每杯要间隔d,下一天间隔默认大于d;问最少喝多少天;思路:每次二分找出大于等于当前cnt+d位置能喝的ai,如果没有就开新一天;#include<algorithm>#include<set>#include<vect...原创 2019-04-08 21:47:59 · 381 阅读 · 0 评论 -
B. Glider
http://codeforces.com/gym/101911/problem/B题意:给n个区间和高度h,区间水平移动,非区间每一步就向下移动一步,起点任取,问最远到哪;思路:区间不相交的!,前缀和求区间长度和间隙长度,枚举每个区间起点,二分找到最远到哪里;#include<algorithm>#include<set>#include<vec...原创 2019-04-07 19:48:46 · 212 阅读 · 0 评论 -
D. Concatenated Multiples
题意:给出数组,任意拼接后mod k==0;如123,234;拼接后123234;问有多少种组合;思路:(数学不好=-=)(x*10^len+y)%k==0 => x*10^len==(k-y)%k;预处理出x*10^len,每个长度位len的集合,然后二分找出(k-y)%k;还有除去自己与自己的拼接;#include<algorithm>#include&...原创 2019-03-26 22:04:18 · 228 阅读 · 0 评论 -
D1. Coffee and Coursework (Easy version) and D2. Coffee and Coursework (Hard Version)
http://codeforces.com/contest/1118/problem/D1http://codeforces.com/contest/1118/problem/D2题意:有n杯咖啡,m张作业,没杯咖啡有能量点a[i],一点能量能做一张作业,同一天喝多杯能量会减少:第一杯a[i],第二杯max(0,a[i]-1),第三杯max(0,a[i]-2).....;问完成m张作业最...原创 2019-02-22 10:40:36 · 482 阅读 · 0 评论 -
C. Magic Ship
http://codeforces.com/contest/1117/problem/C题意:给定起终点,n个风向(循环),顺风则移动2步,成角度则到角度的一步,逆风不动;问是否能到达终点;思路:相当于先随风移动再自由移动,二分天数k,看到k天后在哪个位置,然后自由移动能不能到终点;#include<algorithm>#include<set>#inc...原创 2019-02-22 20:34:57 · 386 阅读 · 0 评论