ZOJ 3798 Abs Problem

A - Abs Problem

Time Limit:2000MS    Memory Limit:65536KB    64bit IO Format:%lld & %llu

Submit Status

Description

Alice and Bob is playing a game, and this time the game is all about the absolute value!

Alice has N different positive integers, and each number is not greater than N. Bob has a lot of blank paper, and he is responsible for the calculation things. The rule of game is pretty simple. First, Alice chooses a number a₁ from the N integers, and Bob will write it down on the first paper, that's b₁. Then in the following kth rounds, Alice will choose a number a_k (2 ≤ k ≤ N), then Bob will write the number b_k=|a_k-b_k-1| on the kth paper. |x| means the absolute value of x.

Now Alice and Bob want to kown, what is the maximum and minimum value of b_N. And you should tell them how to achieve that!

Input

The input consists of multiple test cases;

For each test case, the first line consists one integer N, the number of integers Alice have. (1 ≤ N ≤ 50000)

Output

For each test case, firstly print one line containing two numbers, the first one is the minimum value, and the second is the maximum value.

Then print one line containing N numbers, the order of integers that Alice should choose to achieve the minimum value. Then print one line containing N numbers, the order of integers that Alice should choose to achieve the maximum value.

Attention: Alice won't choose a integer more than twice.

Sample Input

2

Sample Output

1 1
1 2
2 1

解析

就是一道找规律的数学题，死活找不出来，数学题就是弱点啊！

先考虑找最小值，因为最大值就是 b[N] = N - b[N-1] 其中 b[N-1] 是N-1的最小值。（这是一个很重要的思想，在很多题中都有应用）

发现有规律：

a	n	n-1	n-2	n-3
b	n	1	n-3	0

按照这样的排列方式每4个刚好可以抵消掉，因此只需要考虑N%4（或者是(N-1)%4）剩下的部分

N%4	剩下的数列	min
0	没有	0
1	1	1
2	2 1	1
3	3 2 1	0

我也不知道如何证明n%4==1或2时 min==1 为最优答案

#include<cstdio>
using namespace std;

int N;
int min,max;

int main()
{
	while(scanf("%d",&N)==1)
	{
		if(N==1) {printf("1 1\n1\n1\n");continue;}
		if(N==2) {printf("1 1\n1 2\n2 1\n");continue;}
		if(N%4==0 || N%4==3) min=0; else min=1;
		if((N-1)%4==0 || (N-1)%4==3) max=N; else max=N-1;
		printf("%d %d\n",min,max);

		for(int i=N;i>1;i--) printf("%d ",i); printf("1\n");
		for(int i=N-1;i>=1;i--) printf("%d ",i); printf("%d\n",N);
	}

	return 0;
}