Defense kingdom problem

#1

i am not getting this step in the code
dx = max(dx, w + 1 - point_x[n-1]);
dy = max(dy, h + 1 - point_y[n-1]);
cout<<dx-1*dy-1<<endl;

#2

where is the code ? provide code link using ide…

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.