05枚举资料简介.ppt

讨厌的青蛙 struct PLANT {//描述一棵被踩踏的水稻 int x; //水稻的行号 int y; //水稻的列号 } 从被踩踏的水稻中选择两棵(X1, Y1)、(X2, Y2)。判断它们是否能够作为一条青蛙路径上最先被踩踏的两颗水稻。 (X1, Y1)、(X2, Y2)唯一确定了蛙跳的方向和步长，从(X2, Y2)开始，沿着这个方向和步长在稻田内走。 每走一步，判断所到达位置上(X, Y)的水稻是否被踩踏，直到走出稻田为止。 如果在某一步上，(X, Y) 没有被踩踏，则表明(X1,Y1)、(X2, Y2)是一条青蛙路径上最先被踩踏的两颗水稻的假设不成立。 这个判断的算法在问题求解过程中要反复使用，它的效率成为决定整个计算效率的关键。(用二分法查找) 讨厌的青蛙 int r, c, n; struct PLANT { int x, y; }; PLANT plants[5001]; PLANT plant; int myCompare( const void *ele1, const void *ele2 ); int searchPath(PLANT secPlant, int dX, int dY); 讨厌的青蛙——main() int main( ) { int i, j, dX, dY, pX, pY, steps, max = 2; scanf(%d%d, r, c); scanf(%d, n); for ( i = 0; i n; i++ ) scanf(%d %d, plants[i].x, plants[i].y); qsort(plants, n, sizeof(PLANT), myCompare); //找最长路径，见下页 if ( max == 2 ) max = 0; printf(%d\n, max); return 0; } 讨厌的青蛙——main() for ( i = 0; i n - 2; i++ ) for ( j = i + 1; j n - 1; j++ ) { dX = plants[j].x - plants[i].x; dY = plants[j].y - plants[i].y; pX = plants[i].x - dX; pY = plants[i].y - dY; if ( pX = r pX = 1 pY = c pY = 1 ) continue; if ( plants[i].x + max * dX r ) break; pY = plants[i].y + max * dY; if ( pY c || pY 1) continue; steps = searchPath( plants[j], dX, dY ); if ( steps max ) max = steps; } 讨厌的青蛙 int myCompare( const void *ele1, const void *ele2 ) { PLANT *p1, *p2; p1 = (PLANT*) ele1; p2 = (PLANT*) ele2; if ( p1-x == p2-x ) return( p1-y - p2-y ); return ( p1-x - p2-x ); } 讨厌的青蛙 int searchPath( PLANT secPlant, int dX, int dY ) { PLANT plant; int steps; plant.x = secPlant.x + dX; plant.y = secPlant.y + dY; steps = 2; while ( plant.x = r plant.x = 1 plant.y = c plant.y = 1 ) { if ( !bsearch(plant, plants, n, sizeof(PLANT), myCompare) ) { steps = 0; break; }