[알고리즘] 백준 16431 - 베시와 데이지 (C++) [문제 링크] : https://www.acmicpc.net/problem/16431#include using namespace std;int Dy, Dx, By, Bx, Jy, Jx;int main(){ cin >> By >> Bx >> Dy >> Dx >> Jy >> Jx; int b = max(abs(Jy - By), abs(Jx - Bx)); int d = abs(Jy - Dy) + abs(Jx - Dx); if(b d){ cout 알고리즘 2025.02.01