百度無人車

https://www.jisuanke.com/contest/1228/74417

2018年計蒜之道初賽第一題（mmp 計算課反爬蟲題目不能複製）

#include<bits/stdc++.h> using namespace std; typedef long long LL; const int maxn = 1e7; LL a[maxn]; int main() { int n; cin>>n; for(int i = 1; i <= n; i++) cin >>a[i]; LL p,s; cin>>p>>s; int l = 1, r= 100000; while(l < r) { int mid = (l +r)>>1; LL t = 0; for(int i = 1 ; i<= n ;i++) t += max(0LL,a[i]);//根據題意找出方案最小的 if(t * p <= s) r = mid; else l = mid + 1; } cout<<r; return 0; }