题目链接:http://codeforces.com/problemset/problem/1077/E
题意:给出n个题目,每个题目都有一个主题,现在让你安排若干场考试,每场考试的题目数量恰好是前一场的2倍,并且
他们的主题是相同的,问最多能用掉多少题目?
思路:我们想要用掉尽量多的题目,但是策略比较难定,因为用掉的题目多少跟我们第一场考试用掉的题目多少好像没有
直接关系,为了产生这样的关系,我们可以先规定好办几场考试,这样第一场用掉的题目越多总的用掉的就越多,就可以二分
来解决了。因为是乘2操作,所以枚举场数并不会太多,顶多也就办18场.
代码:
#include<bits/stdc++.h>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 2e5+5;
const double eps = 1e-12;
const int inf = 0x3f3f3f3f;
map<ll,int>::iterator it;
struct node
{
ll x;
int num;
}a[maxn];
int n;
map<ll,int> mp;
bool cmp(node x,node y)
{
return x.num< y.num;
}
int find(ll x,int l,int r)
{
if(l> r) return n+1;
while(l<= r)
{
int mid = (l+r)>>1;
if(a[mid].num< x)
l = mid+1;
else
r = mid-1;
}
return l;
}
ll judge(ll v,int li)
{
int sum = 0;
int x = n+1;
ll num = v;
for(int i = 1;i<= n;i++)
{
if(a[i].num>= v)
{
sum = 1;
x = i;
break;
}
}
while(1)
{
num<<= 1;
x = find(num,x+1,n);
if(x> n) break;
sum++;
}
return sum>= li;
}
ll cal(ll v,int num)
{
ll ans = 0;
while(num--)
{
ans+= v;
v<<= 1;
}
return ans;
}
int main()
{
mem(a,0);
cin>>n;
for(int i = 1,x;i<= n;i++)
{
scanf("%lld",&x);
mp[x]++;
}
n = 0;
for(it = mp.begin();it!= mp.end();it++)
{
n++;
a[n].x = it->first;
a[n].num = it->second;
}
sort(a+1,a+n+1,cmp);
ll ans = 0;
for(int i = 1;i<= 20;i++)
{
ll l = 1,r = a[n].num+123;
while(l<= r)
{
ll mid = (l+r)>>1;
if(judge(mid,i))
ans = max(ans,cal(mid,i)),l = mid+1;
else
r = mid-1;
}
}
cout<<ans<<endl;
return 0;
}