Atcoder Beginner round-E Amusement Park (思维 | 二分)

题意:

给N个点,K次访问,每个点有一个值,每个点可以访问无限次,每次访问就可以获得其值,但每访问一次这个点的值就会减1.最大化K次访问后值的总和.

做法1:(思维+模拟)

我们都可以想到要优先取最大的值,所以第一步是将数组从大到小排序,但我们不能一直取最大的那个值,因为它是随着取得次数减小的.所以我们能想到把最大的数取到和第二大的数一样,然后再取第二大的数,将其取到和第三个大的数一样.

eg.
10 9 5 4 3 -> 9 9 5 4 3 -> 5 5 5 4 3 -> 4 4 4 4 3 -> 3 3 3 3 3

我们可以找到规律:第i大的数 可以被取i次

此时我们再结合等差数列的公式就可以算出答案.

细节部分会在代码中注释出来

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#pragma GCC optimize(2)
using namespace std;
#define ll long long
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define PLLL pair<ull,PLL>
#define fi first
#define se second
#define pb push_back
#define debug(a) cout << #a << " " << a << '\n';
const int N = 2e5 + 5;
const int M = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;
#define ull unsigned long long

inline ll read();

ll n, m, k;
PLL a[N];//a[i].first存值, a[i].second存从大到小排序后当前数和后一个数的差值

int main() {
    //ios::sync._with_stdio(false);
    n = read(), k = read();
    ll ans = 0;
    ll sum = 0;
    for (int i = 0; i < n; i++) {
        a[i].fi = read();
        ans += a[i].fi;
    }
    if (k >= ans) {//如果k比所有数字加起来都大,那直接计算所有数字1~a[i]的和
        for (int i = 0; i < n; i++) {
            sum += (a[i].fi + 1) * a[i].fi / 2;//等差数列求和公式
        }
    } else {
        sort(a, a + n);
        reverse(a, a + n);
        for (int i = 0; i < n - 1; i++) {
            a[i].se = (a[i].fi - a[i + 1].fi);
        }
        a[n - 1].se = a[n - 1].fi;

        for (int i = 0; i < n; i++) {
            if (a[i].se * (i + 1) < k) {//第i大的数有i个
                k -= a[i].se * (i + 1);//全部用完
                sum += (a[i].se * a[i].fi - (a[i].se * (a[i].se - 1)) / 2) * (i + 1);
                //cout << sum << '\n';
            } else {
                ll t = k / (i + 1);
                ll left = k % (i + 1);//这i个数同时等差数列求和到最后不一定都能用完
               // cout<<a[i].fi<<'\n';
                sum += (a[i].fi * t - t * (t - 1) / 2) * (i + 1);
                sum += left * (a[i].fi - t);
                k = 0;
            }

            if (k == 0)break;
        }
    }
    cout << sum;
}


inline ll read() {
    char ch = getchar();
    ll p = 1, data = 0;
    while (ch < '0' || ch > '9') {
        if (ch == '-')p = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        data = data * 10 + (ch ^ 48);
        ch = getchar();
    }
    return p * data;
}

做法2:(二分)

先找出所有数的最大值,直接二分答案.check函数里判断当前比mid大的数和mid的差值的和是否大于k,如果大于说明mid值取小了,如果小于说明mid值取大了.

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>

#pragma GCC optimize(2)
using namespace std;
#define ll long long
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define fi first
#define se second
#define pb push_back
#define debug(a) cout << #a << " " << a << '\n';
const int N = 2e5 + 5;
const int M = 1e5 + 5;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;

inline ll read();

ll n, m, k;
ll a[N];

bool check(ll mid) {
    ll ans = 0;
    for (int i = 0; i < n; 
    i++) {
        if (a[i] > mid)ans += a[i] - mid;
    }
    return ans<=k;
}

int main() {
    //ios::sync_with_stdio(false);
    cin >> n >> k;
    ll maxx = -1;
    for (int i = 0; i < n; i++)cin >> a[i], maxx = max(maxx, a[i]);
    ll l = 0, r = maxx;
    ll mid;
    while (l < r) {
        mid = l + r >> 1;
        if (check(mid)) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    ll ans = 0;
    sort(a, a + n);
    reverse(a, a + n);
    //cout << l << ' ' << r << '\n';
    ll cnt = 0;
    for (int i = 0; i < n; i++) {
        if (a[i] > l) {
            ans += (a[i] + l) * (a[i] - l + 1) / 2;
            cnt += a[i] - l + 1;
        }
    }
    ans -= (cnt - k) * l;//把多算的减掉
    cout << ans;


    return 0;
}


inline ll read() {
    char ch = getchar();
    ll p = 1, data = 0;
    while (ch < '0' || ch > '9') {
        if (ch == '-')p = -1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        data = data * 10 + (ch ^ 48);
        ch = getchar();
    }
    return p * data;
}
/*
5 10
10 9 5 4 3
 */