Codeforces Round 920 (Div. 3)

题目链接点这里 这场 div3 F 题的算法很基础，但是我此前居然完全没接触过。（芙莉莲震惊.jpg） 不过这下能够算法沙漠面积--了。 CF1921A Square 1 2 3 4 5 6 7 8 9 10 11 12 13 void solve() { int x1 = 1e9, y1 = 1e9, x2 = -1e9, y2 = -1e9, x, y; for (int i = 1; i <= 4; ++i) { cin >> x >> y; x1 = min(x, x1); y1 = min(y, y1); x2 = max(x, x2); y2 = max(y, y2); } cout << (x2 - x1) * (y2 - y1) << endl; } CF1921B Arranging Cats 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 ...