제출 #785051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
785051		mindiyak	Rice Hub (IOI11_ricehub)	C++14	0 / 100	10 ms	468 KiB

ricehub

#include "ricehub.h"
#include <iostream>

using namespace std;

#define ll long long

int besthub(int R, int L, int X[], long long B)
{
  ll ans = 0;
  for(ll i=0;i<R;i++){
    ll temp_counter=0;
    ll temp_pos=0;
    ll cur_cost = 0;
    ll prev_pos = 0;
    for(ll j=i;j<R;j++){
      prev_pos = temp_pos;
      temp_pos = ((temp_pos * temp_counter) + X[j]) / (temp_counter+1);
      cur_cost += abs(prev_pos-temp_pos)*temp_counter;
      cur_cost += X[j] - temp_pos;
      temp_counter ++;
      if(cur_cost <= B){
        ans=max(ans,(j-i)+1);
      }else{
        break;
      }
      // cout << temp_counter << " " << temp_pos << " " << cur_cost << endl;
    }
  }
  // cout << ans << endl;
  return ans;
}

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