围棋机器人最短路径问题 - C++ 实现

#include #include using namespace std;

int main() { int x1, y1, x2, y2; cin >> x1 >> y1 >> x2 >> y2;

int dx = abs(x2 - x1);
int dy = abs(y2 - y1);

int ans = dx + dy;
cout << ans << endl;

return 0;

}