算法题--讨厌的青蛙

题目传送门https://blog.csdn.net/nnnnnnnnnnnny/article/details/51584284

//青蛙问题，求解一条路径
//这条路径中被一只青蛙压倒的稻子最多
//青蛙只会在一个方向上前进，并且步长是一定的
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int r,c,n;

struct PLANT{
    int x,y;
};  //记录被踩坏的水稻坐标
//为了debug方便自己先初始化
PLANT plants[5001]={
  {2,1},{6,6},{4,2},{2,5},{2,6},{2,7}
,{3,4},{6,1},{6,2},{6,3},{2,3},{6,4},{6,5},{6,7}}; //最多记录5000个坐标
PLANT plant;

//重载小于号
bool operator < (const PLANT &p1, const PLANT &p2){
    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>&