#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
void func()
{
int n;
cin >> n;
vector<int>a(n);
for (auto& x : a)cin >> x;
map<int, int>m;
for (int i = 0; i<n; i++)
{
m[a[i]]++;
}
for (int i = 0; i < *max_element(all(a)); i++)
{
if (m[i] < m[i + 1])
{
cout << "NO" << endl;
return;
}
}
cout << "YES" << endl;
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}
题意:
1.输入n个人,k个金币,每个金币可以换g个银币
即共有k*g个银币,分配给n个人
2.若第i个人有x个银币,r=x mod g
if(r>=g/2向上取整)即可以存下r-g个银币(1)
else可以存下r个银币(2)优先考虑这种情况!因为最大值!
3.最大化存下的银币
思路:
op=(g/2+g%2)-1(对应情况2)
if(op*n>=k*g)答案就是k*g(能存下的都大于总的就直接总的)
else :sum=(n-1)*op,ans=k*g-sum,r=ans%g(最后一个人安排所剩余数最大)
若(r>=g/2向上取整)即sum+=(r-g)否则sum+=r
注意:对g/2向上取整----->g/2+g%2
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#include<numeric>
#include<map>
using namespace std;
#define endl '\n'
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define pii pair<int,int>
const int N = 2e5 + 100;
void func()
{
ll n, k, g;
cin >> n >> k >> g;
ll op = (g / 2 + g % 2) - 1;
if (op * n >= k * g)
{
cout << k * g << endl;
}
else
{
ll sum = (n - 1) * op;
ll ans = k * g - sum;
ll r = ans % g;
if (r >= (g / 2 + g % 2))
sum += (r - g);
else
sum += r;
cout << sum << endl;
}
}
int main()
{
cin.tie(0), cout.tie(0)->sync_with_stdio(false);
int t;
cin >> t;
while (t--)
{
func();
}
return 0;
}