# 最大一点都不大间隔的非常

也许现在听这张treasure会觉的粗糙，的确与众多天音后辈相比确实不过如此，但在当时实在是惊世骇俗，之前独立音乐是男人的天下，而他们的第一张garland是标准的后朋风格，可这张treasure里那liz真假声，反复的吟唱，实在另人惊艳

最大最小间隔的匹配，多行数据输入动态数组分配，怎么利用的C语言实现的

Description

Treasure Hunters

Introduction

You've been a treasure hunter for a long time. You're pretty good at
disarming traps, sneaking past the natives, and generally getting the
goods while leaving your skin intact. That stuff doesn't really worry
you, but what really raises a sweat is after each expedition there are
always very tense arguments about how to split up the loot. You've
worked with all kinds of characters and nobody ever agrees on what each
piece of treasure is actually worth. You need to come up with a way of
splitting the booty as fairly as possible.

Input

You've been a treasure hunter for a long time. You're pretty good at disarming traps, sneaking past the natives, and generally getting the goods while leaving your skin intact. That stuff doesn't really worry you, but what really raises a sweat is after each expedition there are always very tense arguments about how to split up the loot. You've worked with all kinds of characters and nobody ever agrees on what each piece of treasure is actually worth. You need to come up with a way of splitting the booty as fairly as possible.

Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.

Input

A single data set has 5 components:

Start line - A single line, "START"

Number of Treasures - A single line with a single integer, t, where 1
<= t <= 8, indicating the number of treasures.

Number of Hunters - A single line with a single integer, h, where 1
<= h <= 6, indicating the number of treasure hunters.

Treasure Value List - A series of h lines, one for each hunter in
sequence (line 1 for hunter 1, line 2 for hunter 2, etc.). Each line
contains a space-separated list of estimated treasure values for that
hunter. The first estimate on each line is for treasure 1, the second is
for treasure 2, etc., and an estimate for each treasure will appear for
every hunter. Each estimate will be a positive integer strictly less
than 10000.

End line - A single line, "END"

Input to this problem will consist of a (non-empty) series of up to 100 data sets. Each data set will be formatted according to the following description, and there will be no blank lines separating data sets.

Output

A single data set has 5 components:

For each input data set, there will be exactly one output set, and there will be exactly one blank line separating output sets.

电子竞技竞猜平台，Start line - A single line, "START"

Each output set consists of multiple lines, where each line represents a hunter (listed in the same order as the corresponding input data set). Each line contains a list of the treasures given to that hunter followed by the total perceived cash value (by that hunter), of all the treasures they receive. Treasures will be listed in ascending order by treasure number, and all values on each line will be space-separated.

Number of Treasures - A single line with a single integer, t, where 1 <= t <= 8, indicating the number of treasures.

Treasures will be divided among the hunters in the fairest way possible. The "fairest" way to divide the treasure is defined to be the distribution with the minimum difference between the highest perceived total value and the lowest perceived total value of treasures received by any hunter. In other words, find the distribution that minimizes the difference between the hunter that gets the "most" and the hunter that gets the "least."

Number of Hunters - A single line with a single integer, h, where 1 <= h <= 6, indicating the number of treasure hunters.

There will not be multiple "fair" distributions.

Sample Input

Treasure Value List - A series of h lines, one for each hunter in sequence (line 1 for hunter 1, line 2 for hunter 2, etc.). Each line contains a space-separated list of estimated treasure values for that hunter. The first estimate on each line is for treasure 1, the second is for treasure 2, etc., and an estimate for each treasure will appear for every hunter. Each estimate will be a positive integer strictly less than 10000.

START

5

3

42 500 350 700 100

250 200 500 1000 75

150 400 800 800 150

END

START

5

3

42 500 350 200 100

250 200 500 1000 75

150 400 800 800 150

END

START

5

3

500 500 350 200 100

250 200 500 1000 75

150 400 800 800 150

END

Sample Output

End line - A single line, "END"

4 700

3 5 575

1 2 550

Output

1 4 5 342

3 500

2 400

For each input data set, there will be exactly one output set, and there will be exactly one blank line separating output sets.

1 2 1000

4 1000

3 5 950

Each output set consists of multiple lines, where each line represents a hunter (listed in the same order as the corresponding input data set). Each line contains a list of the treasures given to that hunter followed by the total perceived cash value (by that hunter), of all the treasures they receive. Treasures will be listed in ascending order by treasure number, and all values on each line will be space-separated.

Treasures will be divided among the hunters in the fairest way possible. The "fairest" way to divide the treasure is defined to be the distribution with the minimum difference between the highest perceived total value and the lowest perceived total value of treasures received by any hunter. In other words, find the distribution that minimizes the difference between the hunter that gets the "most" and the hunter that gets the "least."

There will not be multiple "fair" distributions.

Sample Input

START

5

3

42 500 350 700 100

250 200 500 1000 75

150 400 800 800 150

END

START

5

3

42 500 350 200 100

250 200 500 1000 75

150 400 800 800 150

END

START

5

3

500 500 350 200 100

250 200 500 1000 75

150 400 800 800 150

END

Sample Output

4 700

3 5 575

1 2 550

1 4 5 342

3 500

2 400

1 2 1000

4 1000

3 5 950

本文由牛竞技发布于电子竞技竞猜平台,转载请注明出处：最大一点都不大间隔的非常

关键词： 牛竞技