满月照亮的路

#include<bits/stdc++.h>using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)#define ll long long#define lrt int l,int r,int rt#define lson l,m...

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=4062#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x...

题目链接：http://codeforces.com/problemset/problem/101/B#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++)#define ll lon...

题目链接：http://codeforces.com/gym/101755/problem/K#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++)#define ll unsigne...

题目链接：http://codeforces.com/problemset/problem/50/D#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++)#define ll unsi...

题目链接：http://codeforces.com/problemset/problem/767/D#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++)#define ll uns...

题目链接：http://codeforces.com/problemset/problem/75/C#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++)#define ll long...

题目链接：http://codeforces.com/contest/1111/problem/C#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++)#define ll long ...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4417题目大意：给定一个整数序列，和若干查询，每次查询区间[l,r]中小于等于x的数有多少个。题目分析： 区间第k小的另一种表达方式，假如我们能够log时间求出第k小的数，就可以二分处理这道题。主席树可以搞定静态第k小。#include&lt;bits/stdc++....

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4560题目大意有n个歌手，m种歌曲，每一场演唱会中约束描述如下：每一场演唱会中每个歌手都要上台，每个歌手都有其擅长曲目，一个歌曲全程被不擅长的歌手演唱的次数不超过k，问最多可以半多少场演唱会。题目分析不难发现题目中的答案隐含二分性质，演唱会场数越多其出错的可能性会越大。...

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6278题目大意给定一个序列和若干个查询，查询给定区间中最大的h满足至少有h个人其权值不小于h。题目分析其实只要知道区间第k小就可以二分做了，然后区间第k小就用主席树搞一下即可，然后二分答案，假设枚举到mid，观察区间第mid小的数x，如果该位置答案R-mid+1符合计数...

题目链接:http://codeforces.com/contest/1132/problem/D题目大意每个同学电脑有初始电量和电量消耗速度，这堂课有k分钟，其损耗过程有note描述。现在有个输出x，每分钟可以指定一个电脑并充电x，问要维护每位同学电脑电量始终不小于零，其最小的x是多少。题目分析这道题思路倒是蛮容易想的，就是细节比较多！可以看出是二分，并且二分上界是...

题目链接:http://codeforces.com/contest/1136/problem/E题目大意给定两个序列，支持两种操作，查询第一个序列的区间和，第二种是修改a数组x位置上的值，增加x，并且如果a[i+1]<a[i]+k[i] 那么a[i+1]=a[i]+k[i]。题目分析[i+1]-S[i]<a[i]-S[i-1]，这样我们把a[i]+S[i...

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=4029#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x...

题目链接：http://codeforces.com/problemset/problem/483/B#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++)#define ll lon...

题目链接：http://codeforces.com/problemset/problem/474/E#include&lt;bits/stdc++.h&gt;using namespace std;#define debug puts("YES");#define rep(x,y,z) for(int (x)=(y);(x)&lt;(z);(x)++)#define read(x...

You are given an array d1,d2,…,dnd1,d2,…,dn consisting of nn integer numbers.Your task is to split this array into three parts (some of which may be empty) in such a way that each element of the arr...

The SUM problem can be formulated as follows: given four lists A,B,C,D of integer values, compute how many quadruplet (a,b,c,d) ∈ A×B×C×D are such that a+b+c+d = 0. In the following, we assume that al...

DifferenceTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1432    Accepted Submission(s): 392Problem DescriptionLittle Ruins is playing a number...

  Online Judge Online Exercise Online Teaching Online Contests Exercise Author F.A.QHand In HandOnline AcmersForum | DiscussStatistical Charts Probl...

Hdu 4217 Data Structure?【二分+树状数组】2017年07月28日 16:06:04阅读数：221 Data Structure?Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3359  ...

区间交Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1424    Accepted Submission(s): 543 Problem Description小A有一个含有n个非负整数的数列与m个区间。每个区间可以表示...

链接：https://www.nowcoder.com/acm/contest/144/A来源：牛客网 题目描述Jigglypuff is holding a singing contest. There are 2n singers indexed from 1 to 2n participating in the contest.The rule of this contest ...

Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.About every day we know exam for which one of m subjects can be passe...

Vases and FlowersTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4695    Accepted Submission(s): 1934 Problem Description　　Alice is so p...

Pete and Bob invented a new interesting game. Bob takes a sheet of paper and locates a Cartesian coordinate system on it as follows: point (0, 0) is located in the bottom-left corner, Ox axis is direc...

小 X 自幼就很喜欢数。但奇怪的是，他十分讨厌完全平方数。他觉得这些数看起来很令人难受。由此，他也讨厌所有是完全平方数的正整数倍的数。然而这丝毫不影响他对其他数的热爱。这天是小X的生日，小 W 想送一个数给他作为生日礼物。当然他不能送一个小X讨厌的数。他列出了所有小X不讨厌的数，然后选取了第 K个数送给了小X。小X很开心地收下了。然而现在小 W 却记不起送给小X的是哪个数了。你能帮他一...

SelectTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2331    Accepted Submission(s): 663 Problem DescriptionOne day, Dudu, the most cle...

C. Candiestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter passing a test, Vasya got himself a box of nn candies. He decided to eat an equal a...