제출 #784147

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
784147		gagik_2007	쌀 창고 (IOI11_ricehub)	C++17	100 / 100	10 ms	2496 KiB

ricehub

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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define ff first
#define ss second

ll ttt;
const ll INF=1e18;
const ll MOD=1e9+7;
const ll N=200007;
ll n,m,k;
ll a[N];

int besthub(int R, int L, int X[], ll B){
    n=R;
    m=L;
    for(int i=0;i<n;i++){
        a[i]=X[i];
    }
    k=B;
    int l=0,r=0;
    int ans=0;
    ll curval=0;
    int mid=0;
    while(l<n&&r<n){
        if(curval<=k){
            ans=max(ans,r-l+1);
            r++;
            if((l+r)%2==0){
                mid++;
            }
            curval+=abs(a[mid]-a[r]);
        }
        else{
            l++;
            if((l+r)%2==0){
                mid++;
            }
            curval-=abs(a[mid]-a[l-1]);
        }
        // cout<<l<<" "<<r<<": "<<curval<<endl;
    }
    return ans;
}

• Subtask 1: 17 / 17
• Subtask 2: 25 / 25
• Subtask 3: 26 / 26
• Subtask 4: 32 / 32