Submission #488653

#	Time	Username	Problem	Language	Result	Execution time	Memory
488653		fun_day	쌀 창고 (IOI11_ricehub)	C++14	68 / 100	1085 ms	520 KiB

ricehub

#include <bits/stdc++.h>

using namespace std;

int besthub(int R, int L, int X[], long long B){
  int best = 0;
  for(int i = 0 ; i < R ; i++){
    vector<int> sz;
    int ans = 0;
    for(int j = i + 1 ; j < R ; j++){
      if(X[j] - X[i] > B) break;
      sz.emplace_back(X[j] - X[i]);
    }
    for(int j = i - 1 ; j >= 0 ; j--){
      if(X[i] - X[j] > B) break;
      sz.emplace_back(X[i] - X[j]);
    }
    sort(sz.begin(),sz.end());
    long long len = 0;
    for(int j = 0 ; j < (int)sz.size() ; j++){
      len += sz[j];
      if(len <= B) ans++;
      else break;
    }
    best = max(best , ans);
  }
  return best + 1;
}

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