哪位大牛帮看下啊!给的数据可以过!
实在是想不出来还有什么别的情况了!
#include "iostream"
#include "cmath"
#define MAX_N 51
using namespace std;
struct ppos
{
	int x,y;
};
int count,sum,h,l;
int park[MAX_N][MAX_N];
struct ppos pos[2501];
int cpos[MAX_N]={0};

int tiny(int a,int b)
{
	if(a<b)
		return a;
	else
		return b;
}

int main()
{
	int i,j,N;
	cin>>N;
	while(N--)
	{
		sum=0;
		count=0;
		cin>>h>>l;
		for(i=0;i<h;i++)
			for(j=0;j<l;j++)
			{
				cin>>park[i][j];
				if(park[i][j] != -1)
				{
					pos[park[i][j]-1].x=i;
					pos[park[i][j]-1].y=j;
					count++;
				}
			}
//			for(i=0;i<count;i++)
//				cout<<pos[i].x<<" "<<pos[i].y<<endl; 
			for(i=0;i<count;i++)
			{
				sum+=pos[i].x * 20 +tiny(abs(pos[i].y - cpos[pos[i].x]),l-abs(pos[i].y - cpos[pos[i].x])) * 5	;
				cpos[pos[i].x]=pos[i].y;
			}
			cout<<sum<<endl;	
	}
	return 0;
}

• Re:why WA? 汗了... (1024) snake19851124 2008-03-22 10:59:13
  • Re:why WA? 汗了... (21) nash635 2008-03-22 18:49:41