阿宁的二进制

题目

思路

我们可以用优先队列来存取数据来得到数组中最大元素，然后将最大元素x变为f(x)，再用一个数组存取每次操作后的最大值，直到最大元素变为1时，就不可能再变小了，最后输出第k次操作后的最大元素即可。

代码

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<bitset>
#include<set>

using namespace std;
#define _CRT_SECURE_NO_WARNINGS 1
#define ll long long
#define pub push_back
#define pob pop_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define inf 2e9
#define llf 1e19
#define endl "\n"
const ll mod = 1e9 + 7;

ll qpow(ll base, ll power)
{
	ll res = 1;
	while (power > 0)
	{
		if (power & 1) res = base * res % mod;
		power >>= 1;
		base = base * base % mod;
	}
	return res;
}

ll gcd(ll a, ll b)
{
	return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b)
{
	return a / gcd(a, b) * b;
}

double dis(double x, double y, double x1, double y1)
{
	return sqrt((x - x1) * (x - x1) + (y - y1) * (y - y1));
}
double dis1(double x, double y, double z, double x1, double y1, double z1)
{
	return sqrt((x - x1) * (x - x1) + (y - y1) * (y - y1) + (z - z1) * (z - z1));
}
double chaji(double x1, double x2, double y1, double y2)
{
	return x1 * y2 - x2 * y1;
}

ll n, q, k, a;
ll ans[2000010];
priority_queue<ll, vector<ll>>que;
int func(int x)//题中的f(x)
{
	int cnt = 0;
	while (x)
	{
		cnt++;
		x = x & (x - 1);
	}
	return cnt;
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	ll i, j, x, ii;
	cin >> n >> q;
	for (i = 1; i <= n; i++)
	{
		cin >> a;
		que.push(a);
	}
	i = 1;
	while (i)
	{
		if (que.top() == 1)//最大元素变为1就退出循环，同时记录操作次数
		{
			ii = i;
			break;
		}
		x = func(que.top());
		que.pop(); que.push(x);
		ans[i] = que.top();
		i++;
	}
	while (q--)
	{
		cin >> k;
		if (k >= ii) cout << 1 << endl;//操作次数大于等于ii，答案肯定时1
		else cout << ans[k] << endl;
	}
}