提出 #74606787

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define Int __int128_t
#define eb emplace_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pY cout << "YES\n"
#define pN cout << "NO\n"

const int MOD = 1e9 + 7;

vector<int> readv(int n)
{
    vector<int> v(n);
    for (int i = 0; i < n; i++)
        cin >> v[i];
    return v;
}

void printv(vector<int> &v)
{
    for (int x : v)
        cout << x << ' ';
    cout << '\n';
}

void solve();

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int tt = 1;
    // cin >> tt;
    while (tt--)
    {
        solve();
        cout << "\n";
    }
    return 0;
}

void solve()
{
    int n,k;
    cin>>n>>k;
    auto b = readv(n); // satisfaction
    auto a = readv(n); // weights
    vector<int>psa(n+1,0);
    vector<int>psb(n+1,0);
    for(int i=0;i<n;i++) psa[i+1] = psa[i] + a[i];
    for(int i=0;i<n;i++) psb[i+1] = psb[i] + b[i];
    int ans = INT_MIN;
    for(int i=0;i<n;i++){
        int lo = i, hi = n-1;
        while(lo<=hi){
            int mid = lo + (hi-lo)/2;
            if(psa[mid+1] - psa[i] <= k){
                ans = max(ans, psb[mid+1] - psb[i]);
                lo = mid + 1;
            }else{
                hi = mid - 1;
            }
        }
    }
    cout<<ans;
}

提出情報

ジャッジ結果