← All problemsSign in

Maximal Trigonal Area

CodeChefRating 3992Open on judge ↗

You are given $N$ distinct points $(P_{1, x}, P_{1, y}), (P_{2, x}, P_{2, y}), \dots, (P_{N, x}, P_{N, y})$ on the coordinate plane, and $Q$ queries in the form `L R X`. In each query, consider the polygon formed by the points in the interval $[L,R]$ (i.e. the points $(P_{L, x}, P_{L, y}), (P_{L+1, x}, P_{L+1, y}), \dots, (P_{R, x}, P_{R, y})$), along with $(0,0)$ and $(X,0)$. - If this polygon

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start