Codeforces Round #148 (Div. 2) D. Boring Partition（“证明？”唯一方案“取值最优？”）

最新推荐文章于 2022-05-06 12:55:01 发布

_wjunjie

最新推荐文章于 2022-05-06 12:55:01 发布

阅读量234

点赞数

分类专栏：思维题泛做

本文链接：https://blog.csdn.net/qq_41661919/article/details/98346516

版权

思维题泛做专栏收录该内容

108 篇文章 4 订阅

订阅专栏

D. Boring Partition

This problem is the most boring one you've ever seen.

Given a sequence of integers a1, a2, ..., an and a non-negative integer h, our goal is

to partition the sequence into two subsequences (not necessarily consist of continuous

elements). Each element of the original sequence should be contained in exactly one of

the result subsequences. Note, that one of the result subsequences can be empty.

Let's define function f(ai, aj) on pairs of distinct elements (that is i ≠ j) in the original sequence.

If ai and aj are in the same subsequence in the current partition then f(ai, aj) = ai + aj

otherwise f(ai, aj) = ai + aj + h.

Consider all possible values of the function f for some partition. We'll call the goodness

of this partiotion the difference between the maximum value of function f and the

minimum value of function f.

Your task is to find a partition of the given sequence a that have the minimal possible

goodness among all possible partitions.

Input

The first line of input contains integers n and h (2 ≤ n ≤ 105, 0 ≤ h ≤ 108). In the second

line there is a list of n space-separated integers representing a1, a2, ..., an (0 ≤ ai ≤ 108).

Output

The first line of output should contain the required minimum goodness.

The second line describes the optimal partition. You should print n whitespace-separated

integers in the second line. The i-th integer is 1 if ai is in the first subsequence otherwise

it should be 2.

If there are several possible correct answers you are allowed to print any of them.

Examples

input
3 2
1 2 3
output
1
1 2 2 
input
5 10
0 1 0 2 1
output
3
2 2 2 2 2 
Note

In the first sample the values of f are as follows: f(1, 2) = 1 + 2 + 2 = 5,

f(1, 3) = 1 + 3 + 2 = 6 and f(2, 3) = 2 + 3 = 5. So the difference between

maximum and minimum values of f is 1.

In the second sample the value of h is large, so it's better for one of

the sub-sequences to be empty.

题意：

将一个序列分成两个部分，其中一个可以为空，相同序列中的任意两个数相加

会产生一权值，不同、部分的两数相加再加上给定值h得到权值，找一种分配方案，

使得最终最大权值-最小权值最小。

思路：

这题真的不难，比赛真就没做出来，赛后根据猜想手证明了一下思路，

发现最终最优解只能从两种极端方案中（最小值最大or最大值最小）取得，

之前还考虑是否会有一种折中方案介于这两者之间成为更优解，但是手写一下

调整前后大小关系的加减式发现，所谓的”折中方案“只会让差值更大。

最后再注意n<=2的情况即可，这题因该很容易想到这个特判。

代码实现：

#include<iostream>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#include<algorithm>
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int N=2e5+100;
const int M=4e4+100;
const  int mod=1e9+9;
struct Node{
	int val,id;
}arr[N];
bool cmp(Node aa,Node bb){
	return aa.val<bb.val;
}
int main(){
	
	int n,h;
	LL mini,maxs,pos;
	while(cin>>n>>h){
		mini=INF;
		maxs=0;
		for(int i=1;i<=n;i++){
			cin>>arr[i].val;
			arr[i].id=i;
		}
		if(n<=2){
			cout<<0<<endl;
			for(int i=1;i<=n;i++){
				cout<<2<<" ";
			}
			cout<<endl;
			continue;
		}
		sort(arr+1,arr+1+n,cmp);
		maxs=arr[n].val+arr[n-1].val;
		mini=arr[1].val+arr[2].val;
		LL ans1=maxs-mini;
		maxs=max(arr[n].val+arr[n-1].val,arr[1].val+arr[n].val+h);
		mini=min(arr[1].val+arr[2].val+h,arr[2].val+arr[3].val);
		LL ans2=maxs-mini;
		cout<<min(ans1,ans2)<<endl;
		if(ans1<=ans2){
			for(int i=1;i<=n;i++){
				cout<<2<<" ";
			}	
		}else{
			pos=arr[1].id;
			for(int i=1;i<=n;i++){
				if(i==pos){
					cout<<1;
				}else cout<<2;
				cout<<" ";
			}
		}
		cout<<endl;
	}
	return 0;
	
}

THE END；