[{"createTime":1735734952000,"id":1,"img":"hwy_ms_500_252.jpeg","link":"https://activity.huaweicloud.com/cps.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=V1g3MDY4NTY=&utm_medium=cps&utm_campaign=201905","name":"华为云秒杀","status":9,"txt":"华为云38元秒杀","type":1,"updateTime":1735747411000,"userId":3},{"createTime":1736173885000,"id":2,"img":"txy_480_300.png","link":"https://cloud.tencent.com/act/cps/redirect?redirect=1077&cps_key=edb15096bfff75effaaa8c8bb66138bd&from=console","name":"腾讯云秒杀","status":9,"txt":"腾讯云限量秒杀","type":1,"updateTime":1736173885000,"userId":3},{"createTime":1736177492000,"id":3,"img":"aly_251_140.png","link":"https://www.aliyun.com/minisite/goods?userCode=pwp8kmv3","memo":"","name":"阿里云","status":9,"txt":"阿里云2折起","type":1,"updateTime":1736177492000,"userId":3},{"createTime":1735660800000,"id":4,"img":"vultr_560_300.png","link":"https://www.vultr.com/?ref=9603742-8H","name":"Vultr","status":9,"txt":"Vultr送$100","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":5,"img":"jdy_663_320.jpg","link":"https://3.cn/2ay1-e5t","name":"京东云","status":9,"txt":"京东云特惠专区","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":6,"img":"new_ads.png","link":"https://www.iodraw.com/ads","name":"发布广告","status":9,"txt":"发布广告","type":1,"updateTime":1735660800000,"userId":3},{"createTime":1735660800000,"id":7,"img":"yun_910_50.png","link":"https://activity.huaweicloud.com/discount_area_v5/index.html?fromacct=261f35b6-af54-4511-a2ca-910fa15905d1&utm_source=aXhpYW95YW5nOA===&utm_medium=cps&utm_campaign=201905","name":"底部","status":9,"txt":"高性能云服务器2折起","type":2,"updateTime":1735660800000,"userId":3}]
Luogu 1873
Core perception :
①: about check() function : Once this judgment function related to calculating the sum ——sum=0 Be sure to write it in front
②: Because the answer of binary search can be huge , Just use it all long long
Thought of judgment :
①: principal axis : It's the line between the answer and the scope , Such as the height of saw blade , The side length of the divided cake .
②: Countershaft : The variable required .
#include<bits/stdc++.h> using namespace std; long long l=1,r=9e9; long long
sum=0;long long ans; long long n,k; bool check(long long arry[],long long m) {
sum=0; for(int i=1;i<=n;i++) { if(m<arry[i]) { sum+=arry[i]-m; } }
if(sum>=k)return 1; return 0; } int main() { scanf("%lld%lld",&n,&k); long long
arry[n+1]; for(int i=1;i<=n;i++)scanf("%lld",&arry[i]); while(l<=r) { long long
m=l+(r-l)/2; if(check(arry,m)) { ans=m; l=m+1; } else r=m-1; }
printf("%lld",ans); return 0; }
Luogu 2440
Where I write wrong :
while Core code in the loop r=m+1 and l=m-1 Something went wrong .( It's written backwards )
Forget to write while Code snippet inside int m=l+(r-l)/2;( It was discovered after debugging )