# SDUT 2409：The Best Seat in ACM Contest

## 题目描述

Cainiao is a university student who loves ACM contest very much. It is a festival for him once when he attends ACM Asia Regional Contest because he always can find some famous ACMers there.
Cainiao attended Asia Regional Contest Fuzhou Site on November 20, 2011. After he got seat map, he wanted to know which seat is the best one.
Cainiao have joined so many QQ Group about ACM/ICPC that he is almost familiar with the strength of each team. In his mind, the value of a seat is defined as following:

1. Strength of each team can be expressed as a positive integer.
2. The value of a seat is related to the adjacent seat (up/down/left/right, only four directions being considering).
3. For an adjacent seat, if the strength of this team is stronger than yours, the absolute value of difference of two teams should be added to your seat, otherwise, the absolute value of difference should be subtracted from your seat.
4. If the adjacent seat is empty (which means you are located at the most left/right/up/down), the value of your seat should be subtracted 1.
5. The best one in a contest is the seat that has the highest value.
6. The initial value of the seat is ZERO.

For example, there are 12 ( 3 X 4 ) teams in a contest, the strength of each team is as figure (a), and then you can calculate the value of each seat as figure (b).

## 输入

Input contain a positive integer T( T <=50 ) in the first line, which means T cases.
The first line of each case contains two positive integers N and M (3 <= N, M <= 20) which means the row and column number of the teams, then N rows following, each line contains M positive integers that represent the strengths of the teams.

## 输出

For each case, first output the case number, and then output the value and row number and column number of the best seat in one line for each case.
If there are multiple solutions for one case, you should output the seat whose row number is largest and only output the seat whose column number is largest if still overlapping.

## 示例输入

1
3 4
1 5 3 4
6 3 3 4
4 3 2 1

## 示例输出

Case 1: 7 1 1

## 每一块的数字等于它周围四个块的和-4*当前块！边界以外块的值=其相邻-1；

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
int T;
cin>>T;
int a[105][105],bb[105][105];
for(int i=1;i<=T;i++)
{
memset(a,0,sizeof(a));
memset(bb,0,sizeof(bb));
int n,m;
cin>>n>>m;
for(int j=1;j<=n;j++)
for(int k=1;k<=m;k++)
{
cin>>a[j][k];
if(j==1)a[j-1][k]=a[j][k]-1;
if(j==n)a[j+1][k]=a[j][k]-1;
if(k==1)a[j][k-1]=a[j][k]-1;
if(k==m)a[j][k+1]=a[j][k]-1;
}
int maxx=0,mi=0,mj=0;
for(int j=1;j<=n;j++)
{
for(int k=1;k<=m;k++)
{
bb[j][k]=a[j-1][k]+a[j+1][k]+a[j][k-1]+a[j][k+1]-4*a[j][k];
if(bb[j][k]>maxx)
{
maxx=bb[j][k];
mi=j;
mj=k;
}
}
}
printf("Case %d: %d %d %d\n",i,maxx,mi,mj);
}
return 0;
}  

• 评论

• 上一篇
• 下一篇