제출 #1003145

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003145		vjudge1	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1091 ms	1736 KiB

ricehub

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define pf push_front
#define pb push_back
#define pi pair<int,int>
#define vi vector<int>

/*
int besthub(int n, int last, int x[], ll b){
    

    int ans = 0;
    int l , r;
    for(int i = 0; i < n; i++){
        
        l = i - (lower_bound(x.begin(), x.end(), max(0LL,x[i]-b))- x.begin());
        r =  upper_bound(x.begin(), x.end(), min((ll) last, x[i]+b)) - x.begin() - (i+1);
       // cout << x[i] << " " <<l << " " << r << endl;
        ans = max(l+r+1,ans);
    }
    
    return ans;

}

*/

int besthub(int n, int last, int x[], ll b){
    

    ll ans = 0;
    ll l , r;
    ll cnt;
    
    ll dl = 0, dr = 0;
    for(int i = 0; i < n; i++){
        cnt = 1;
        ll left = b;
        
        l = i-1,r = i+1;
        while( (l >= 0 || r<n)){
            dl = LLONG_MAX,dr = LLONG_MAX;
            if (l>=0) dl= x[i]-x[l];
            if (r<n) dr = x[r]-x[i];
           // cout << x[i] << " " << l << " " << r<< endl;
            if(l>= 0 && (r>=n || dl <= dr)){
                if(left<dl) break;
                left-= dl;
                l--;
            }
            else{   
                if(left<dr) break;
                left-= dr;
                r++;
            } 
            cnt++;

        }
        ans = max(ans,cnt);
    }
    
    return ans;

}

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