Codeforces 149C Division into Teams 【思维】

C. Division into Teams

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Petya loves football very much, especially when his parents aren't home. Each morning he comes to the yard, gathers his friends and they play all day. From time to time they have a break to have some food or do some chores (for example, water the flowers).

The key in football is to divide into teams fairly before the game begins. There are n boys playing football in the yard (including Petya), each boy's football playing skill is expressed with a non-negative characteristic ai (the larger it is, the better the boy plays).

Let's denote the number of players in the first team as x, the number of players in the second team as y, the individual numbers of boys who play for the first team as pi and the individual numbers of boys who play for the second team as qi. Division n boys into two teams is considered fair if three conditions are fulfilled:

• Each boy plays for exactly one team (x + y = n).
• The sizes of teams differ in no more than one (|x - y| ≤ 1).
• The total football playing skills for two teams differ in no more than by the value of skill the best player in the yard has. More formally:

Your task is to help guys divide into two teams fairly. It is guaranteed that a fair division into two teams always exists.

Input

The first line contains the only integer n (2 ≤ n ≤ 105) which represents the number of guys in the yard. The next line contains n positive space-separated integers, ai (1 ≤ ai ≤ 104), the i-th number represents the i-th boy's playing skills.

Output

On the first line print an integer x — the number of boys playing for the first team. On the second line print x integers — the individual numbers of boys playing for the first team. On the third line print an integer y — the number of boys playing for the second team, on the fourth line print y integers — the individual numbers of boys playing for the second team. Don't forget that you should fulfil all three conditions: x + y = n, |x - y| ≤ 1, and the condition that limits the total skills.

If there are multiple ways to solve the problem, print any of them.

The boys are numbered starting from one in the order in which their skills are given in the input data. You are allowed to print individual numbers of boys who belong to the same team in any order.

Sample test(s)

input

3
1 2 1

output

2
1 2 
1
3 

input

5
2 3 3 1 1

output

3
4 1 3 
2
5 2 

Note

Let's consider the first sample test. There we send the first and the second boy to the first team and the third boy to the second team. Let's check all three conditions of a fair division. The first limitation is fulfilled (all boys play), the second limitation on the sizes of groups (|2 - 1| = 1 ≤ 1) is fulfilled, the third limitation on the difference in skills ((2 + 1) - (1) = 2 ≤ 2) is fulfilled.

题意：给你n个人以及每人的val值，要求选出两支队伍x和y，记sumx为x队伍所有人val值之和，sumy同理。

要求两支队伍人数之差不能超过1且|sumx-sumy| <= 所有人中最大的val值。问你选人方案。

思路：把n个人当做坐标轴的点，取点搞。显然轮流取是满足的，前面相邻奇偶数差之和不会超过最后那个数。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <string>
#define INF 0x3f3f3f3f
#define eps 1e-8
#define MAXN (100000+10)
#define MAXM (200000+10)
#define Ri(a) scanf("%d", &a)
#define Rl(a) scanf("%lld", &a)
#define Rf(a) scanf("%lf", &a)
#define Rs(a) scanf("%s", a)
#define Pi(a) printf("%d\n", (a))
#define Pf(a) printf("%.2lf\n", (a))
#define Pl(a) printf("%lld\n", (a))
#define Ps(a) printf("%s\n", (a))
#define W(a) while(a--)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define MOD 10007
#define LL long long
#define lson o<<1, l, mid
#define rson o<<1|1, mid+1, r
#define ll o<<1
#define rr o<<1|1
#define PI acos(-1.0)
#define first fi
#define second se
using namespace std;
int belong[MAXN];
struct Node{
    int val, id;
};
Node num[MAXN];
bool cmp(Node a, Node b){
    return a.val < b.val;
}
int main()
{
    int n; Ri(n);
    for(int i = 1; i <= n; i++)
    {
        Ri(num[i].val);
        num[i].id = i;
    }
    sort(num+1, num+n+1, cmp); //int sumx = 0, sumy = 0; belong[num[0].id] = 1;
    Pi(n & 1 ? n / 2 + 1 : n / 2); int cnt = 0;
    for(int i = 1; i <= n; i++)
    {
        if(i & 1)
        {
            if(cnt) printf(" ");
            printf("%d", num[i].id);
            cnt++;
        }
    }
    printf("\n");
    Pi(n / 2); cnt = 0;
    for(int i = 1; i <= n; i++)
    {
        if(i % 2 == 0)
        {
            if(cnt) printf(" ");
            printf("%d", num[i].id);
            cnt++;
        }
    }
    printf("\n");
    return 0;
}