Codeforces Round 936 (Div. 2)A-C

A.Median of an Array

题意：给一个数组，找到中位数x，每次操作你可以让其加一，问让中位数x变成比原来大一要几次操作

思路：找到当前的中位数，计算后面有几个与其相等的，全部加一。

#include<bits/stdc++.h>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 1000005
//#define int long long
#define  mod 1000000007
using namespace std;
int a[N];
int main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        for (int i = 1; i <= n; i++)
            scanf("%d", &a[i]);
        sort(a+1, a + n+1);
        int k = upper_bound(a + 1, a + n + 1, a[(n+1 ) / 2]) - a-1;
        printf("%d\n", k - (n+1) / 2+1);
    }
}

B.Maximum Sum

题意：你可以选择数组中的子数组（可以为空），求和并查入数组的任意位置，求k次操作后数组最大的和

思路，最大子段和

#include<bits/stdc++.h>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 1000005
#define int long long
#define  mod 1000000007
using namespace std;
int a[N];
signed main() {
    int T; scanf("%lld", &T);
    while (T--) {
        int n, k; scanf("%lld%lld", &n, &k); int sum = 0, all = 0;
        
        for (int i = 1; i <= n; i++) {
            scanf("%lld", &a[i]);
            sum =(sum+ a[i])%mod;
        }
        int pre = 0, maxx = 0;//pre为i之前的最大字段和
        for (int i = 1; i<=n; i++) {
            pre = max(0ll, pre + a[i]);//更新pre,如果是负数就记为0
            maxx = max(maxx,pre);
        }
        int tsum = sum;
        for (int i = 1; i <= k; i++) {
            sum = (sum + maxx) % mod;
            maxx = (maxx * 2) % mod;
        }
        cout << (sum % mod + mod) %mod<< endl;
    }
}

C.Tree Cutting

题意：问移去k条边。剩余的连通块中最小的最大是多少，比如五个节点，移除一条边可以分为1:2,3,4,5 ; 1,2:3,4,5,那么最小的连通块有1或者1,2，那么答案就是2；

#include<bits/stdc++.h>
#define Max 0x7fffffff
#define  LL long long
#define  ULL unsigned long long
#define N 2000005
//#define int long long
#define  mod 1000000007
using namespace std;
int n, k, cnt;
vector<int>e[N];

int dfs(int now, int lst, int t) {
    int num = 1;
    for (auto x : e[now]) {
        if (x == lst) continue;
        num += dfs(x, now, t);
    }
    if (num >= t) {
        cnt++;
        return 0;
    }
    return num;
}

bool check(int x) {
    cnt = 0;
    dfs(1, -1, x);
    return cnt > k;
}

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%d%d", &n, &k);
        for (int i = 0; i <= n; i++)e[i].clear();


        for (int i = 1; i < n; i++) {
            int u, v;
            scanf("%d%d", &u, &v);
            e[u].push_back(v);
            e[v].push_back(u);
        }
        int left = 1, right = n;
        while (left + 1 < right) {
            int mid = (left + right) / 2;
            if (check(mid))left = mid;
            else right = mid;
        }

        if (check(right))cout << right << endl;
        else cout << left << endl;
    }
}