#include "ricehub.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}
int besthub(int n , int t , int arr[] , ll b){
ll p[n];
p[0] = arr[0];
for(int i = 1; i < n; i++){
p[i] = (arr[i] * 1LL) + p[i-1];
}
int ans = 1;
for(int i = 0; i < n; i++){
int l = 0 , r = i;
//ll cur = 0;
while(l <= r){
ll mid = (l + r)/2;
ll sum = (i - 1 >= 0 ? p[i-1] : 0) , res = 0;
if(i - mid > 0)sum -= p[i - (mid + 1)];
sum = (mid * 1LL * arr[i]) - sum;
for(int j = 0; j < 2; j++){
int rp = i + mid + j;
if(rp < n && rp >= i){
ll s = p[i + mid + j];
s -= p[i];
ll cnt = mid + j;
ll s1 = sum + ((s) - (cnt * 1LL * arr[i]));
if(s1 <= b){
res = max(res , (mid+1+mid+j));
}
}
}
if(res == 0){
r = mid - 1;
}
else l = mid + 1;
ans = max(ans , (int)res);
//cur = max(cur, res);
}
//cout << cur << ' ';
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
308 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
236 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
0 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
300 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
0 ms |
204 KB |
Output is correct |
| 13 |
Correct |
0 ms |
204 KB |
Output is correct |
| 14 |
Correct |
0 ms |
204 KB |
Output is correct |
| 15 |
Correct |
0 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
300 KB |
Output is correct |
| 18 |
Correct |
0 ms |
204 KB |
Output is correct |
| 19 |
Correct |
0 ms |
204 KB |
Output is correct |
| 20 |
Correct |
0 ms |
204 KB |
Output is correct |
| 21 |
Correct |
0 ms |
204 KB |
Output is correct |
| 22 |
Correct |
0 ms |
204 KB |
Output is correct |
| 23 |
Correct |
0 ms |
300 KB |
Output is correct |
| 24 |
Correct |
1 ms |
288 KB |
Output is correct |
| 25 |
Correct |
1 ms |
300 KB |
Output is correct |
| 26 |
Correct |
0 ms |
204 KB |
Output is correct |
| 27 |
Correct |
1 ms |
204 KB |
Output is correct |
| 28 |
Correct |
0 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
304 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
1 ms |
204 KB |
Output is correct |
| 6 |
Correct |
0 ms |
204 KB |
Output is correct |
| 7 |
Correct |
1 ms |
204 KB |
Output is correct |
| 8 |
Correct |
1 ms |
204 KB |
Output is correct |
| 9 |
Correct |
1 ms |
204 KB |
Output is correct |
| 10 |
Correct |
1 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
0 ms |
204 KB |
Output is correct |
| 13 |
Correct |
1 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
0 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
204 KB |
Output is correct |
| 21 |
Correct |
1 ms |
316 KB |
Output is correct |
| 22 |
Correct |
1 ms |
332 KB |
Output is correct |
| 23 |
Correct |
1 ms |
332 KB |
Output is correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| 25 |
Correct |
1 ms |
332 KB |
Output is correct |
| 26 |
Correct |
1 ms |
332 KB |
Output is correct |
| 27 |
Correct |
1 ms |
344 KB |
Output is correct |
| 28 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
3 ms |
588 KB |
Output is correct |
| 2 |
Correct |
4 ms |
552 KB |
Output is correct |
| 3 |
Correct |
27 ms |
1968 KB |
Output is correct |
| 4 |
Correct |
20 ms |
1980 KB |
Output is correct |
| 5 |
Correct |
10 ms |
1224 KB |
Output is correct |
| 6 |
Correct |
10 ms |
1228 KB |
Output is correct |
| 7 |
Correct |
38 ms |
1952 KB |
Output is correct |
| 8 |
Correct |
39 ms |
1868 KB |
Output is correct |
| 9 |
Correct |
9 ms |
1100 KB |
Output is correct |
| 10 |
Correct |
9 ms |
1100 KB |
Output is correct |
| 11 |
Correct |
20 ms |
1868 KB |
Output is correct |
| 12 |
Correct |
21 ms |
1976 KB |
Output is correct |
| 13 |
Correct |
9 ms |
1228 KB |
Output is correct |
| 14 |
Correct |
10 ms |
1228 KB |
Output is correct |
| 15 |
Correct |
15 ms |
1596 KB |
Output is correct |
| 16 |
Correct |
15 ms |
1676 KB |
Output is correct |
| 17 |
Correct |
18 ms |
1856 KB |
Output is correct |
| 18 |
Correct |
17 ms |
1740 KB |
Output is correct |
| 19 |
Correct |
19 ms |
1920 KB |
Output is correct |
| 20 |
Correct |
18 ms |
1876 KB |
Output is correct |
