Statement
You are given a vector of pairs (x_i, y_i) for size N.
Constraint : 1 <= x_i,y_i <=N
For each j from 1 to 1000
, find out the maximum value of j*x_i + y_i
amongst all i's from 1 to N
.
Help Required On This Problem!
You are given a vector of pairs (x_i, y_i) for size N.
Constraint : 1 <= x_i,y_i <=N
For each j from 1 to 1000
, find out the maximum value of j*x_i + y_i
amongst all i's from 1 to N
.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en6 |
![]() |
Misa-Misa | 2023-09-15 12:32:32 | 41 | Tiny change: ' `1 to N`.' -> ' `1 to N`.<br>\n\nFinally print those N values.<br>' | |
en5 |
![]() |
Misa-Misa | 2023-09-15 12:31:01 | 5 | Tiny change: 'rom `1 to 1000`, find ou' -> 'rom `1 to N`, find ou' | |
en4 |
![]() |
Misa-Misa | 2023-09-15 12:30:19 | 2 | Tiny change: 'ongst all i's from `1' -> 'ongst all `i`'s from `1' | |
en3 |
![]() |
Misa-Misa | 2023-09-15 12:29:45 | 14 | Tiny change: 'i,y_i <=N`<br>\nFor ' -> 'i,y_i <=N` and `N<=1e5` <br>\nFor ' (published) | |
en2 |
![]() |
Misa-Misa | 2023-09-15 12:28:57 | 3 | Tiny change: ' of pairs (x_i, y_i) for size ' -> ' of pairs `(x_i, y_i)` for size ' | |
en1 |
![]() |
Misa-Misa | 2023-09-15 12:28:34 | 262 | Initial revision (saved to drafts) |