제출 #1220643

#제출 시각아이디문제언어결과실행 시간메모리
1220643hmms127Rice Hub (IOI11_ricehub)C++20
0 / 100
0 ms324 KiB
#include "ricehub.h" #include <bits/stdc++.h> using namespace std; #define ll long long int besthub (int n, int L, int a[], ll B) { int r=0,idx=0,ans=0; ll dist=0; for(int i=0;i<n;i++){ dist+=a[i]-a[r]; while(r<i&&(r-idx+1)<(i-r+1)){ dist-=(i+idx-r*2-1)*(a[r+1]-a[r]); r++; } while(dist>B){ dist-=a[r]-a[idx]; idx++; while(r<i&&(r-idx+1)<(i-r+1)){ dist-=(i+idx-r*2-1)*(a[r+1]-a[r]); r++; } } ans=max(ans,r-idx+1); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...