제출 #133016

#제출 시각아이디문제언어결과실행 시간메모리
133016tinjyu쌀 창고 (IOI11_ricehub)C++14
0 / 100
5 ms504 KiB
#include "ricehub.h" #include <iostream> using namespace std; long long int sum[100005],a[100005][2]; int besthub(int R, int L, int X[], long long B) { long long int now=0; for(int i=0;i<R;i++) { sum[i]=sum[i-1]+X[i]; } long long int s=1,e=1; long long int ans=0; while(s<=e && e<R) { //cout<<s<<" "<<e<<endl; long long int mid=(s+e)/2; //cout<<mid<<endl; long long int tmp=(X[mid]*(mid-s)-(sum[mid]-sum[s])+(sum[e]-sum[mid])-X[mid]*(e-mid)); //cout<<tmp<<endl; if(tmp<=B) { ans=max(ans,e-s+1); e++; } else s++; } return ans; }

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

ricehub.cpp: In function 'int besthub(int, int, int*, long long int)':
ricehub.cpp:7:16: warning: unused variable 'now' [-Wunused-variable]
  long long int now=0;
                ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...