#P13379. [GCJ 2011 #3] Dire Straights

[GCJ 2011 #3] Dire Straights

题目描述

You are playing a card game, where each card has an integer number written on it.

To play the game, you are given some cards — your handhand. Then you arrange the cards in your hand into straightsstraights. A straight is a set of cards with consecutive values; e.g. the three cards {3,4,5}\{3, 4, 5\}, or the single card {7}\{7\}. You then receive a number of dollars equal to the length of the shortest straight. If you have no cards, you can form no straights, so you get zero dollars.

You will be given a series of test cases, each of which describes the cards you will have in your hand. Find the maximum number of dollars you can receive for each test case.

输入格式

The first line of the input contains the number of test cases, TT. Each test case consists of one line. Each line contains NN, the number of cards in your hand, followed by NN integers giving the numbers on those cards. These numbers are all space-separated.

输出格式

For each test case, output one line containing "Case #xx: yy", where xx is the case number (starting from 1) and yy is the maximum number of dollars you can receive.

4
10 1 2 3 4 5 10 9 8 7 6
8 101 102 103 104 105 106 103 104
0
5 1 2 3 4 9
Case #1: 10
Case #2: 4
Case #3: 0
Case #4: 1

提示

Sample Explanation

In case 1, you have ten cards numbered 11 to 1010, so you make one straight of length 1010, and get 1010 dollars.

In case 2, you could make two straights {101,102,103,104,105,106}\{101, 102, 103, 104, 105, 106\} and {103,104}\{103, 104\} and get 22 dollars. But it would be better to make {101,102,103,104}\{101, 102, 103, 104\} and {103,104,105,106}\{103, 104, 105, 106\} and get 44 dollars.

In case 4, the card with the number 99 must be in a straight containing only that card. So you get 11 dollar.

In case 3, you have zero cards, so you get zero dollars. You don't get money for nothing.

Limits

  • 1T1001 \leq T \leq 100
  • The numbers on the cards are between 11 and 1000010000.

Small dataset (4 Pts, Test set 1 - Visible)

  • 0N100 \leq N \leq 10
  • Time limit: 30 3 seconds.

Large dataset (12 Pts, Test set 2 - Hidden)

  • 0N10000 \leq N \leq 1000
  • Time limit: 60 6 seconds.