#include int w,h,n,m,ld,min,i,j,k,l; void dot(int list[l], int H[l][l]){ int tmp[l],ans=0; for(i=0;itmp[j+1]?(tmp[j]-tmp[j+1]):(tmp[j+1]-tmp[j]); min=tmp[j]>tmp[j+1]?tmp[j+1]:tmp[j]; for(k=0;k