제출 #1346972

#제출 시각아이디문제언어결과실행 시간메모리
1346972michael12Rice Hub (IOI11_ricehub)C++20
컴파일 에러
0 ms0 KiB
#include "ricehub.h"
#include<iostream>
#include<vector>
#include<set>
#include<map>
#include<numeric>
#include<string>
#include<stack>
#include<queue>
#include<string.h>
#include<array>
#include<climits>
#include<algorithm>
#include<cmath>
using namespace std;
#define ff first
#define ss second
#define ll long long
#define int long long
#define endl '\n'
const int maxn = 5e5;
int besthub(int R, int L, int x1[], ll B){
    vector<int> x(R);
    for(int i = 0; i < R; i++){
      x[i] = x1[i];
    }
    vector<int> pref(R);
    pref[0] = x[0];
    for(int i = 1; i < R; i++){
      pref[i] = pref[i - 1] + x[i];
    }
    auto cost = [&](int l, int r){
      int l1 = 0, r1 = 0;
      int mid = (l + r) / 2;
      l1 += x[mid] * (mid - l) - (pref[mid - 1] - pref[l - 1]);
      r1 += pref[r] - pref[mid] - x[mid] * (r - mid);
      return l1 + r1;
    };
    int cur = 0;
    int l = 0;
    ll mx = 0;
    for(int r = 0; r < R; r++){
        while(cost(l, r) > B){
          l += 1;
        }
        mx = max(mx, r - l + 1LL);
    }
    return mx;
}

//  signed main(){
//   int R, L, B;
//   cin >> R >> L >> B;
//   int X[R];
//   for(int i = 0; i < R; i++){
//     cin >> X[i];
//   }
//   int a = besthub(R, L, X, B);
//   cout << a;

// }

컴파일 시 표준 에러 (stderr) 메시지

/usr/bin/ld: /tmp/ccXas0f6.o: in function `main':
grader.cpp:(.text.startup+0xaa): undefined reference to `besthub(int, int, int*, long long)'
collect2: error: ld returned 1 exit status