题意 :
- 给 n n n个 a i a_i ai,在数轴找 n + 1 n+1 n+1个点,使得 ∑ i = 1 n 2 ∗ a i ∗ ∣ x 0 − x i ∣ \sum_{i=1}^{n}2*a_i*|x_0-x_i| ∑i=1n2∗ai∗∣x0−xi∣最小
思路 :
- 贪心,直接把 x 0 x_0 x0放在0点, a i a_i ai越大的离 x 0 x_0 x0越近
- sort的系数greater()实现从大到小的效果
- 方案一 :除了原数组外再开一个数组p,对p进行排序,p[i]表示第i大的元素在原先数组中的下标,奇偶下标分别遍历一次,res[i]表示原数组中下标为i的元素放的位置,1,3,5,分别对应位置是1,2,3。然后再遍历累加得到答案;使用vector定长数组的好处 :不浪费空间,且可以直接根据下标输入,不需要pb
- 方案二 :结构体(或者pair),第一个存 a i a_i ai,第二个存原先的下标,再开一个数组,数组下标表示原先id,然后放入对应应该输出的值,配合l和r双指针,根据奇偶性放
// 方案一
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <unordered_set>
#include <math.h>
#define endl '\n'
#define fi first
#define se second
using namespace std;
using ll = long long;
void solve()
{
int n; cin >> n;
vector<int> a(n + 1);
vector<int> p(n + 1);
for (int i = 1; i <= n; i ++ ) cin >> a[i], p[i] = i;
sort(p.begin() + 1, p.end(), [&](int x, int y){
return a[x] > a[y]; // a[p[i]] > a[p[j]]
});
vector<int> res(n + 1);
res[0] = 0;
for (int i = 1; i <= n; i += 2) res[p[i]] = (i + 1) / 2;
for (int i = 2; i <= n; i += 2) res[p[i]] = -(i + 1) / 2;
ll sum = 0;
for (int i = 1; i <= n; i ++ ) sum += 2ll * a[i] * abs(res[i]);
cout << sum << endl;
for (int i = 0; i <= n; i ++ ) cout << res[i] << " \n"[i == n];
}
int main()
{
cin.tie(nullptr) -> sync_with_stdio(false);
int _;
cin >> _;
while (_ -- )
solve();
return 0;
}
// 方案二
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <unordered_set>
#define endl '\n'
#define fi first
#define se second
using namespace std;
using ll = long long;
const int N = 2e5 + 10;
typedef pair<int, int> PII;
PII a[N];
int p[N];
void solve()
{
int n; cin >> n;
for (int i = 1; i <= n; i ++ ) cin >> a[i].fi, a[i].se = i;
sort(a + 1, a + n + 1, greater<PII>());
p[0] = 0;
int l = -1, r = 1;
ll sum = 0;
for (int i = 1; i <= n; i ++ )
{
if (i % 2)
{
sum += 2ll * a[i].fi * r;
p[a[i].se] = r ++ ;
}
else
{
sum += 2ll * a[i].fi * (-l);
p[a[i].se] = (l -- );
}
}
cout << sum << endl;
for (int i = 0; i <= n; i ++ ) cout << p[i] << " \n"[i == n];
}
int main()
{
cin.tie(nullptr) -> sync_with_stdio(false);
int _;
cin >> _;
while (_ -- )
solve();
return 0;
}