Statement
You are given a vector of pairs (x_i, y_i)
for size N.
Constraint : 1 <= x_i,y_i <=N
and N<=1e5
For each j from 1 to N
, find out the maximum value of j*x_i + y_i
amongst all i
's from 1 to N
.
Finally print those N values.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
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
and N<=1e5
For each j from 1 to N
, find out the maximum value of j*x_i + y_i
amongst all i
's from 1 to N
.
Finally print those N values.
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) |
Название |
---|