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
.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
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) |
Name |
---|