已經是水到一定程度了QAQ…
Code:

#include<cstdio> #include<algorithm> #include<cstring> using namespace std; const int maxn = 105; int tp[maxn], idx[maxn], n,m, spare[maxn], cnt; bool cmp(int i,int j) { return i > j;} inline bool check(int val) {int fin = 0;for(int i = 1;i <= n; ++i){while(spare[i] >= val) {++fin, spare[i] -= val;if(fin >= n) break;}}if(fin >= n) return 1; return 0; } int main() {//freopen("input.in","r",stdin);scanf("%d%d",&n,&m);for(int i = 1;i <= m; ++i){int u; scanf("%d",&u); if(!idx[u]) idx[u] = ++cnt;++tp[idx[u]];}sort(tp + 1, tp + 1 + cnt, cmp);int l = 1, r = 10000000, ans = 0;while(l <= r){int mid = (l + r) >> 1;for(int i = 1;i <= cnt; ++i) spare[i] = tp[i];if(check(mid)) l = mid + 1, ans = mid;else r = mid - 1;}printf("%d",ans);return 0; }

轉載于:https://www.cnblogs.com/guangheli/p/9845132.html

總結

以上是生活随笔為你收集整理的Codeforces div2 #499 B. Planning The Expedition 大水题的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。