一年级儿歌大雨和小雨:看看我的"NOI2004第二题,花生采摘程序."有毛病么?

#include<stdio.h>
#include<math.h>
main()
{
FILE *pf1,*pf2;
int m,n,time;
int dat[16][16];
int peanuts=0,max,maxn,maxm;
int i,j,mn,mm,q=1,s;
pf1=fopen("d:\peanuts.in","r");
pf2=fopen("d:\peanuts.out","w");
fscanf(pf1,"%d%d%d",&m,&n,&time);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
fscanf(pf1,"%d",&dat[i][j]);
fclose(pf1);
while(time>0)
{
s=0;
{
max=0; maxn=0; maxm=0;
for(i=0;i<m;i++)
for(j=0;j<n;j++)
if(dat[i][j]>max)
{
max=dat[i][j];
maxm=i;
maxn=j;
}
}
if(q)
{
q=0;
if(time-maxm-1>0)
time=time-maxm-1;
peanuts=peanuts+dat[maxm][maxn];
dat[maxm][maxn]=0;
mn=maxn; mm=maxm; s=1;
}
else
{
if(time-abs(maxm-mm)-abs(maxn-mn)>0)
time=time-abs(maxm-mm)-abs(maxn-mn);
peanuts=peanuts+dat[maxm][maxn];
dat[maxm][maxn]=0;
mn=maxn; mm=maxm; s=1;
}
if(!s)
break;
}
fprintf(pf2,"%d",peanuts);
fclose(pf2);
printf("He can pick %d peanuts\n",peanuts);
getch();
}
数据:
6 7 21
0 0 0 0 0 0 0
0 0 0 0 13 0 0
0 0 0 0 0 0 7
0 15 0 0 0 0 0
0 0 0 9 0 0 0
0 0 0 0 0 0 0
问题:http://www.ynjy.cn/officeall/aosai/self_list.asp?id=4599