POJ3224 Go for Lab Cup!

水题，但是题目内容难读懂，累加一遍即可。

 

Optimal Parking

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 7579		Accepted: 4555

Description

When shopping on Long Street, Michael usually parks his car at some random location, and then walks to the stores he needs. Can you help Michael choose a place to park which minimises the distance he needs to walk on his shopping round? Long Street is a straight line, where all positions are integer. You pay for parking in a specific slot, which is an integer position on Long Street. Michael does not want to pay for more than one parking though. He is very strong, and does not mind carrying all the bags around.

Input

The first line of input gives the number of test cases, 1 ≤ t ≤ 100. There are two lines for each test case. The first gives the number of stores Michael wants to visit, 1 ≤ n ≤ 20, and the second gives theirn integer positions on Long Street, 0 ≤ x_i ≤ 99.

Output

Output for each test case a line with the minimal distance Michael must walk given optimal parking.

Sample Input

2
4
24 13 89 37
6
7 30 41 14 39 42

Sample Output

152
70

Source

Nordic 2007

//oimonster
#include<cstdio>
#include<cstdlib>
#include<iostream>
using namespace std;
int a[101][101],s[101];
int main(){
    int i,j,n;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++){
            scanf("%d",&a[i][j]);
            s[i]+=a[i][j];
            s[j]+=5-a[i][j];
        }
    int max,ans;
    max=ans=0;
    for(i=1;i<=n;i++){
        if(s[i]>max){
            max=s[i];
            ans=i;
        }
    }
    printf("%d
",ans);
    return 0;
}