Pinkie Pie Eats Patty-cakes(贪心或者二分)

Pinkie Pie has bought a bag of patty-cakes with different fillings! But it appeared that not all patty-cakes differ from one another with filling. In other words, the bag contains some patty-cakes with the same filling.

Pinkie Pie eats the patty-cakes one-by-one. She likes having fun so she decided not to simply eat the patty-cakes but to try not to eat the patty-cakes with the same filling way too often. To achieve this she wants the minimum distance between the eaten with the same filling to be the largest possible. Herein Pinkie Pie called the distance between two patty-cakes the number of eaten patty-cakes strictly between them.

Pinkie Pie can eat the patty-cakes in any order. She is impatient about eating all the patty-cakes up so she asks you to help her to count the greatest minimum distance between the eaten patty-cakes with the same filling amongst all possible orders of eating!

Pinkie Pie is going to buy more bags of patty-cakes so she asks you to solve this problem for several bags!

Input

The first line contains a single integer TT (1≤T≤1001≤T≤100): the number of bags for which you need to solve the problem.

The first line of each bag description contains a single integer nn (2≤n≤1052≤n≤105): the number of patty-cakes in it. The second line of the bag description contains nn integers a1,a2,...,ana1,a2,...,an (1≤ai≤n1≤ai≤n): the information of patty-cakes' fillings: same fillings are defined as same integers, different fillings are defined as different integers. It is guaranteed that each bag contains at least two patty-cakes with the same filling.

It is guaranteed that the sum of nn over all bags does not exceed 105105.

Output

For each bag print in separate line one single integer: the largest minimum distance between the eaten patty-cakes with the same filling amongst all possible orders of eating for that bag.

Example

input

Copy

复制代码
4
7
1 7 1 6 4 4 6
8
1 1 4 6 4 6 4 7
3
3 3 3
6
2 5 2 3 1 4

output

Copy

复制代码
3
2
0
4

Note

For the first bag Pinkie Pie can eat the patty-cakes in the following order (by fillings): 11, 66, 44, 77, 11, 66, 44 (in this way, the minimum distance is equal to 33).

For the second bag Pinkie Pie can eat the patty-cakes in the following order (by fillings): 11, 44, 66, 77, 44, 11, 66, 44 (in this way, the minimum distance is equal to 22).

思路:

题意:最大化相同的相邻a的距离,=》其实是平均分配

1,可以二分,也可以贪心推公式,我fw

2,贪心:找到出现最多次的几个数,x个出现num次的数,对其平均分配,其它的不用管,

答案=(n-num*x)/(x-1)+num-1;

(n-num*x)剩余的个数,/(x-1)相邻之间插得数的个数,num-1次数相同的数导致的距离

代码:

cpp 复制代码
int a[maxj];
void solve(){
    int n;cin>>n;
    map<int,int>mp;
    int mx=0,sum=0;
    for(int i=1;i<=n;++i){
        cin>>a[i];
        mp[a[i]]++;
        if(mp[a[i]]==mx)sum++;
        if(mp[a[i]]>mx){
            mx=mp[a[i]];
            sum=1;
        }
    }
    cout<<(n-sum*mx)/(mx-1)+sum-1<<'\n';
}
相关推荐
ShineWinsu20 小时前
对于Qt:QFormLayout常见属性以及方法的解析
开发语言·c++·qt·面试·客户端·表单·qformlayout
kyle~20 小时前
嵌入式 SoC 系统
linux·c++·嵌入式·计算系统
罗西的思考21 小时前
【轻量化复刻大模型 / KIMI K3】Muon 优化器及 训练系统
人工智能·算法·机器学习
ashiho1 天前
【LeetCode hot 100】3. 无重复字符的最长子串 (三种解法)
java·数据结构·后端·算法·leetcode·滑动窗口
数据工匠老o1 天前
数据库没死,业务卡住了:行锁等待、元数据锁、长事务的排查路径
数据库·算法·架构
黑客笔记1 天前
安全态势感知中的资产失陷排名思考
人工智能·算法·网络安全
爱写Bug的浮游1 天前
C++移动构造真的比拷贝快吗
c++·性能优化
Aaa西红柿鸡蛋1 天前
网络协议分析实验:基于 UDP 广播模型的 C/S 通信设计与实现
c++
青少儿编程课堂1 天前
蓝桥杯·全国青少年信息素养大赛·电子学会Python/C++考级:扫描线与线段树求矩形面积并解析
c++·python·算法·bfs·信息学竞赛