Lines and Queries I

CSESGeometryOpen on judge ↗

Your task is to efficiently process the following types of queries: - Add a line ax+b - Find the maximum point in any line at position x Input The first line has an integer n: the number of queries. The following n lines describe the queries. The format of each line is either "1 a b" or "2 x". You may assume that the first query is of type 1. Output Print the answer for each query of type

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