The potato problem

CodeChefRating 2848Open on judge ↗

A 1-concave polygon is a simple polygon (its sides don't intersect or touch) which has at least 1 concave interior angle. There are N points on a plane. Let S be the maximum area of a 1-concave polygon with vertices in those points. Compute 2S. Note that if there is no such (1-concave) polygon, you should print -1. Input - The first line of the input contains an integer T - the number of tes

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