Codeforces 979 Div2 A-D (D. QED‘s Favorite Permutation详解)

沈阳lce

于 2024-10-20 14:29:58 发布

阅读量997

点赞数 23

CC 4.0 BY-SA版权

文章标签：算法

本文链接：https://blog.csdn.net/2301_81278039/article/details/143092151

比较开心能做出D

A

原题

A. A Gift From Orangutan

思路

找到最大值最小值差值乘n - 1 即可

代码

#include <bits/stdc++.h>
#define int long long

#define F(i, a, b) for (int i = (a); i <= (b); i++)
#define dF(i, a, b) for (int i = (a); i >= (b); i--)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 500005, M = (N << 1), inf = 1e16, mod = 1e9 + 7;

int n, m, k, x, y, z, ans, t;
int w[N], f[N];

void solve()
{
	cin >> n;
	int minn = 2000, maxx = 0;
	for (int i = 1; i <= n; i ++ )
	{
		cin &