#1161420 (C++23) No.3513 Greedy Yokan Party

• 問題: No.3513 Greedy Yokan Party
• ユーザー: deuteridayo
• 提出日時: 2026-04-24 22:19:45
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 358 ms / 2,000 ms
• コード長: 3,448 bytes
• コンパイル時間: 4,400 ms
• コンパイル使用メモリ: 382,712 KB
• 実行使用メモリ: 8,192 KB
• 最終ジャッジ日時: 2026-04-24 22:20:12
• 合計ジャッジ時間: 17,346 ms
• ジャッジサーバーID （参考情報）: judge4_0 / judge3_0

ファイルパターン	結果
sample	AC * 1
other	AC * 26

ソースコード

#ifndef MY_HEADER
#define MY_HEADER

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
using llint = __int128_t;
struct edge;
using graph = vector<vector<edge>>;
#define endl '\n'
constexpr int INF = 1<<30;
constexpr lint INF64 = 1LL<<61;
constexpr lint mod107 = 1e9+7;
using mint107 = modint1000000007;
constexpr long mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x) {assert(x >= 0); lint ans = sqrt(x); while(ans*ans > x)ans--; while((ans+1)*(ans+1)<=x)ans++; return ans;}
double Dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
lint DistSqr(lint x1, lint y1, lint x2, lint y2){return (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2); }
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= p;} firstCallnCr = false;} if(n<0)return 0; if(r<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define rrep(i, x) for(int i = x-1; i >= 0; i--)
#define vec vector
#define pb push_back
#define eb emplace_back
#define se second
#define fi first
#define al(x) x.begin(),x.end()
#define ral(x) x.rbegin(),x.rend()


struct edge{
    edge(lint v, lint c = 1) {to = v, cost = c;}
    lint to;
    lint cost;
};

#endif


int main(){
    lint N, L, K;cin >> N >> L >> K;
    vec<lint>A(N+2);
    rep(i, N) cin >> A[i+1];
    A[N+1] = L;
    lint upper = INF64;
    lint lower = 1;
    while(upper > lower + 1) {
        lint mid = (upper + lower) / 2;
        vec<lint>chk(N+1);
        vec<lint>minn(N+2, INF);
        rrep(i, N+1) {
            if(L-A[i] < mid) chk[i] = INF;
            else {
                auto it = lower_bound(al(A), A[i]+mid);
                chk[i] = it - A.begin();
            }
             minn[i] = min(minn[i+1], chk[i] - i);
        }
        bool chkk = false;
        rep(i, N+1) {
            if(chk[i] > INF/2 || minn[chk[i]] > INF/2) break;
            if(chk[i]-i + minn[chk[i]] <= N+2-K) chkk = true; 
            // cout << i << " " << chk[i]-i + minn[chk[i]] << endl;
        }

        //     cout << mid <<endl;
        // rep(i, N+1) {
        //     cout << chk[i] << " ";
        // }
        // cout << endl;
        // rep(i, N+1) {
        //     cout << minn[i] << " ";
        // }
        // cout << endl << endl;
        if(chkk) lower = mid;
        else upper = mid;

    }
    cout << lower << endl;
}