제출 #113697

#제출 시각아이디문제언어결과실행 시간메모리
113697degelo쌀 창고 (IOI11_ricehub)C++17
100 / 100
16 ms1792 KiB
#include<bits/stdc++.h> #include "ricehub.h" using namespace std; int besthub(int r,int l,int x[],long long int b){ int M=0; int ini=0,fim=0; long long int soma=0; while(fim<r){ if(soma<=b){ M=max(M,fim-ini+1); int med=(fim+ini+1)/2; fim++; soma+=(x[fim]-x[med]); //cout<<ini<<ends<<fim<<ends<<soma<<endl; } else{ int med=(fim+ini+1)/2; soma-=(x[med]-x[ini]); ini++; //cout<<ini<<ends<<fim<<ends<<soma<<endl; } } return M; } /*int main(){ int r,l,b; int x[100000]; scanf("%d %d %d",&r,&l,&b); for(int i=0;i<r;i++){ scanf("%d",&x[i]); } printf("%d",besthub(r,l,x,b)); }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...