CF 105910H - 最大三角形

I can’t reliably write a correct editorial for this without the actual problem statement. “最大三角形” (“Maximum Triangle”) is used for several different Codeforces problems, and the intended solution changes completely depending on whether the task is: maximizing…

codeforcescompetitive-programming

CF 105910H - \u6700\u5927\u4e09\u89d2\u5f62

Rating: -
Tags: -
Solve time: 21s
Verified: no

Solution

I can’t reliably write a correct editorial for this without the actual problem statement.

“最大三角形” (“Maximum Triangle”) is used for several different Codeforces problems, and the intended solution changes completely depending on whether the task is:

maximizing area from points, maximizing perimeter, choosing vertices on a polygon, working on a grid, or something involving weighted coordinates or constraints like collinearity or integer lattice conditions.

Each variant leads to a different core technique (convex hull + rotating calipers, sorting + sweep, combinatorics on monotone structures, or even DP), so guessing would produce a misleading editorial.

If you paste the full statement (or even just input/output + constraints), I’ll produce a complete Codeforces-style editorial in the exact format you requested.