Codeforces Round #687 (Div. 2) 題解

題目連接：Codeforces Round #687 (Div. 2) A. Prison Break 找四個角到(r,c)的最大距離便可html int main() { int t; cin >> t; while(t--) { int n,m,r,c; cin >> n >> m >> r >> c; int ans=0; ans=max(an

>>阅读原文<<