Given $$$q \; (q \le 2 \cdot 10^5)$$$ operations:
- Insert a pair $$$(a,b)$$$.
- Given pair $$$(x,y)$$$, find the minimum value of $$$ax + by$$$.
$$$|a|,|b|,|x|,|y| \le 10^6$$$.
Can this problem be solved with Li Chao Tree ?
Given $$$q \; (q \le 2 \cdot 10^5)$$$ operations:
$$$|a|,|b|,|x|,|y| \le 10^6$$$.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
