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
.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|