結果

問題 No.972 選び方のスコア
コンテスト
ユーザー Enjapma_kyopro
提出日時 2020-01-18 00:54:19
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 124 ms / 2,000 ms
コード長 4,170 bytes
コンパイル時間 2,279 ms
コンパイル使用メモリ 175,044 KB
実行使用メモリ 9,672 KB
最終ジャッジ日時 2024-06-26 04:01:28
合計ジャッジ時間 5,972 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#include <unistd.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
long long int INF = 3e18;
const ll fact_table = 800008;
double Pi = 3.1415926535897932384626;
 
//vector<ll> G[550010];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
// priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←
 
 
#define p(x) cout<<x<<"\n";
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
 
 
//ll mod = 998244353;
ll mod = 1000000007;
 
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}
 
/*
ll fact[fact_table + 5],rfact[fact_table + 5];
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = rui(fact[fact_table],mod - 2);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/
 
ll n,m,num,sum,a,b,c,d,e,g,h,w, i,j,q,r,l;
ll k;
ll ans;
ll x[500005], y[200005], z[200005];
// char s[500005], t[500005];
bool used[3005][3004];
ll dp[3004][3004];
char s[2005][2005];

bool solve(ll mid, ll center){
    ll r = n - mid;
    ll l = center - mid;
    assert(l >= 0);
    if(x[l] + x[r] >= 2 * x[center]){
        return true;
    }else{
        return false;
    }
}

bool solve2(ll mid, ll center1, ll center2){
    ll r = n - mid;
    ll l = center1 - mid;
    assert(l >= 0);
    if(x[l] + x[r] >= center1 + center2){
        return true;
    }else{
        return false;
    }
}

ll ruiseki(ll l, ll r){
    return y[r] - y[l];
}
int main(){
    /*
    cin.tie(0);
    ios::sync_with_stdio(false);
    */
    cin >> n;
    for(ll i=0;i<n;i++){
        cin >> x[i];
    }
    sort(x, x + n);
    for(ll i=0;i<n;i++){
        y[i+1] = x[i];
    }
    for(ll i=0;i<n;i++){
        y[i+2] += y[i+1];
    }
    for(ll i=0;i<n;i++){
        // mid = x[i];
        ll left = i;
        ll right = n - i - 1;
        ll max_size = min(left, right);
        ll ok = 0, ng = max_size + 1;
        while(ng - ok > 1){
            ll mid = (ok + ng) / 2;
            bool res = solve(mid, i);
            if(res){
                ok = mid;
            }else{
                ng = mid;
            }
        }
        ll sum_l = ruiseki(n - ok, n);
        ll sum_r = ruiseki(i - ok, i);
        ans = max(ans, sum_l + sum_r - 2 * ok * x[i]);
    }
    for(ll i=0;i<n-1;i++){
        // mid = x[i] + x[i+1] / 2;
        ll left = i;
        ll right = n - i - 2;
        ll max_size = min(left, right);
        ll ok = 0, ng = max_size + 1;
        while(ng - ok > 1){
            ll mid = (ok + ng) / 2;
            bool res = solve2(mid, i, i + 1);
            if(res){
                ok = mid;
            }else{
                ng = mid;
            }
        }
        ll sum_l = ruiseki(n - ok, n);
        ll sum_r = ruiseki(i - ok, i);
        ans = max(ans, sum_l + sum_r - ok * (x[i] + x[i+1]));

    }
    p(ans);
    return 0;
}
0