codeforces-1201 C Maximum Median

二分查找的典型应用，寻找虚无的值代入测试

 1 #include <bits/stdc++.h>
 2 #define _for(i,a,b) for(int i = (a);i < b;i ++)
 3 typedef long long ll;
 4 using namespace std;
 5 inline ll read()
 6 {
 7     ll ans = 0;
 8     char ch = getchar(), last = ' ';
 9     while(!isdigit(ch)) last = ch, ch = getchar();
10     while(isdigit(ch)) ans = (ans << 1) + (ans << 3) + ch - '0', ch = getchar();
11     if(last == '-') ans = -ans;
12     return ans;
13 }
14 inline void write(ll x)
15 {
16     if(x < 0) x = -x, putchar('-');
17     if(x >= 10) write(x / 10);
18     putchar(x % 10 + '0');
19 }
20 ll n,k;
21 ll a[200006];
22 bool C(ll d)
23 {
24     ll line = a[n/2]+d;
25     ll tmpk = k;
26     tmpk -= d;
27     _for(i,n/2+1,n)
28         if(a[i]<line)
29             tmpk -= line-a[i];
30         else
31             break;
32     return tmpk>=0;
33 }
34 ll solve()
35 {
36     ll lb = 0,ub = 1000000002;
37     while(ub - lb > 1)
38     {
39         ll mid =  lb+(ub-lb)/2;
40         if(C(mid)) lb = mid;
41         else ub = mid;
42     }
43     return lb;
44 }
45 int main()
46 {
47     n = read(),k = read();
48     _for(i,0,n)
49         a[i] = read();
50     sort(a,a+n);
51     ll rnt = solve();
52     write(rnt+a[n/2]);
53     return 0;
54 }

转载于:https://www.cnblogs.com/Asurudo/p/11301711.html

codeforces-1201 C Maximum Median相关推荐

【CodeForces - 1201C】Maximum Median（思维，水题）
题干: You are given an array aa of nn integers, where nn is odd. You can make the following operation ...
【CodeForces - 485D】Maximum Value （枚举，用数组离散化，数学，取模运算，因子，筛法）
题干: You are given a sequence a consisting of n integers. Find the maximum possible value of (intege ...
codeforces 702A A. Maximum Increase(水题)
题目链接: A. Maximum Increase time limit per test 1 second memory limit per test 256 megabytes input sta ...
codeforces 332B B. Maximum Absurdity(rmq)
题目链接: codeforces 332B 题目大意: 给出一个序列,让找出不互相覆盖的两个长度为k的段,问在两个段的权值和最大的情况下,按照左边段的左端点排序,右边段的左端点作为第二关键字排序,得到 ...
Codeforces 1201
C. 解对数组排序后后缀加.注意中位数的值不一定等于数组中的某个元素. Code #include<bits/stdc++.h> using namespace std; typedef ...
【CodeForces - 1060C】Maximum Subrectangle （思维，预处理前缀和，dp，枚举长度）
题干: You are given two arrays aa and bb of positive integers, with length nn and mmrespectively. Let ...
【 CodeForces - 1060B 】Maximum Sum of Digits（思维，构造）
题干: You are given a positive integer nn. Let S(x)S(x) be sum of digits in base 10 representation of ...
【Codeforces 1157F】 Maximum Balanced Circle | 思维、dp、二分
题目大意: 给出一个序列aia_iai,序列中选出若干个数使它们满足下面条件: 按一定规则排序成为一个环后,任意相邻两项绝对值相差≤1\le 1≤1 输出最多能选择多少个数,并将这些数按照合法的规则 ...
Codeforces Contest 1144 E Median String —— 水题
This way 题意: 给你两个字符串,问你字典序在这两个字符串正中间的字符串是什么题解: 好几个星期没做题目了,连1900都想了一段时间,一开始想着用2进制来做,但是想着想着发现直接用2进制做不 ...

codeforces-1201 C Maximum Median

codeforces-1201 C Maximum Median相关推荐

最新文章

热门文章