Submission #998880

#	Time	Username	Problem	Language	Result	Execution time	Memory
998880		Mr_Husanboy	쌀 창고 (IOI11_ricehub)	C++17	68 / 100	1094 ms	3692 KiB

ricehub

#include "ricehub.h"
#include <bits/stdc++.h>

using namespace std;
#define ll long long

int besthub(int n, int lim, int a[], long long cost)
{
  int ans = 0;
  for(int i = 0; i < n; i ++){
    int l = i, r = i + 1;
    ll cur = 0;
    int cnt = 0;
    while(l >= 0 || r < n){
      if((l >= 0 && a[i] - a[l] < a[r] - a[i]) || (r >= n)){
        cur += a[i] - a[l];
        l --;
      }else{
        cur += a[r] - a[i];
        r ++;
      }
      if(cur > cost) break;
      cnt ++;
    }
    ans = max(ans, cnt);
  }
  return ans;
}

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