m0_64177548的博客

#include <bits/stdc++.h>using namespace std;typedef long long ll;const int N = 100010;int n,m;ll a[N],sum[N];bool find(ll mid){ int k=0; for(int i=n;i>0;i--) { if(mid<=a[i]) //说明这个装备可以满足装备mid个士兵 { ...

#include <bits/stdc++.h>using namespace std;typedef long long ll;const int N = 1001000;ll t,n,a[N],ans,k;ll check(ll mid)// x就是mid{ ll i; //下面定个小根堆q priority_queue<int, vector<int>, greater<int>> q; ...