摘要：
寻找向左凸的地方，每个左凸能让S数量-2。上边或下边如果是半个左凸的话则各对应-1#include #include #include using namespace std;#define MAX_ROW 205#define MAX_COLUMN MAX_ROWint row, column;char grid[MAX_ROW][MAX_COLUMN];void input(){ memset(grid, 0, sizeof(grid)); for (int i = 0; i 0 && grid[x][y - 1] == 'S') y--, s_... 阅读全文
posted @ 2013-08-18 23:33
undefined2024
阅读(275)
评论(0)
推荐(0)
摘要：
优先队列广搜，有人说用SPFA，不知道怎么做的#include #include #include #include #include using namespace std;#define MAX_COORDINATE 205#define inf 0x3f3f3f3f#define EDGE 200struct Grid{ int left, right, up, down;}grid[MAX_COORDINATE][MAX_COORDINATE]; // using down-left coner point to present a girdstruct Point{ in... 阅读全文
posted @ 2013-08-18 15:46
undefined2024
阅读(358)
评论(0)
推荐(0)
浙公网安备 33010602011771号