七九河开的博客

题目 https://vjudge.net/problem/Gym-101234G 题意 给你n个数，为你这n个数组成的集合中和第k小的是多少 思路 二分答案 #include <bits/stdc++.h> using namespace std; const int maxn = 2e5+100; const int maxm = 1e6+100; int a[ma...

题目 http://acm.sdut.edu.cn/onlinejudge2/index.php/Home/Index/problemdetail/pid/4532.html 题意 给你n个点 分成两组 让max（碰精队max - 碰精队min， 杠精队max - 杠精队min） 的值 最小 思路 二分图染色缩点 将矛盾的点分为两个线段 找到所有点最大和最小 如果是同一个线段 差即答案...

https://cn.vjudge.net/problem/Gym-101194D #include &lt;bits/stdc++.h&gt; using namespace std; typedef long long ll; ll a[300005]; int q,n,k; int vis[300005]; int id[300005]; bool f(ll x) { for(;...

题目 https://cn.vjudge.net/problem/URAL-1133 题意  给你斐波那契数的某两项，求第n项 思路 暴力二分给的下标小的的第二项 用另一个验证 #include &lt;bits/stdc++.h&gt; using namespace std; typedef long long ll; ll a[10000]; ll x1,x2,x3,y1,y2; i...

Ivan has an array consisting of n different integers. He decided to reorder all elements in increasing order. Ivan loves merge sort so he decided to represent his array with one or several increasing ...

After a year of hard work, Mano finally had a month off. He decided to take his grandmother to Soteropolis during this time. As soon as they arrived at the airport, Mano bought one of these "10 things...

while(l+1&lt;r) { mid = (l+r)&gt;&gt;1; if(ok(m)) l = m; else r = m; } if(ok(r)) printf("%d \n",r); else printf("%d \n",l); 二分查找（百度百科） #include&lt;iostr...

There are n squirrel(s) waiting below the feet of m chestnut tree(s). The first chestnut of the i-th tree will fall right after Ti second(s), and one more every Pisecond(s) after that. The “big mama” ...

You are given n integers a1, a2, ..., an. Find the number of pairs of indexes i, j (i &lt; j) that ai + aj is a power of 2 (i. e. some integer x exists so that ai + aj = 2x). Input T...

上色的纱雾 Time Limit: 1000MSMemory Limit: 65536KB Problem Description 纱雾画画功力首屈一指，现在她准备上色了，这时候她在想，怎样上色的时间最短呢？     在这里我们把问题简化，平面图抽象成坐标轴，需要上色的地方抽象成 n 个点，纱雾有 m 支画笔。 开始的时候纱雾可以选择让画笔落在坐标轴任意一