제출 #355596

#제출 시각아이디문제언어결과실행 시간메모리
355596David_M쌀 창고 (IOI11_ricehub)C++14
100 / 100
16 ms1516 KiB
#include "ricehub.h" #include<bits/stdc++.h> #define ll long long using namespace std; const int N=100005; ll ans, pref[N], l, r, m, b; int besthub(int R,int L,int X[],ll B){ for (int i=0; i<R; i++)pref[i]=X[i]+(i>0)*pref[i-1]; for (r=0; r<R; r++){ while(l<r){ m=l+r>>1; b=pref[r]+(l>0)*pref[l-1]-(pref[m]<<1); if((l+r+1)&1)b+=X[m]; if(b<=B)break; l++; } ans=max(ans, r-l+1); } return ans; }

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

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:11:7: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   11 |    m=l+r>>1;
      |      ~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...