# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
TheForces Round #11 (DIV2.5-Forces) Editorial
Note $$$maxp$$$ as the maximum index of the maximum value in $$$a$$$.
For $$$1 \leq k \leq maxp-1$$$,they do not meet the condition.
For $$$maxp+1 \leq k \leq n$$$,they all meet the condition.
You need to be careful of $$$k==maxp$$$,it meet the condition if and only if there is only one maximum value in $$$a$$$.
1
1
1
1
1
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en25 |
![]() |
wuhudsm | 2023-04-16 21:26:25 | 67 | ||
en24 |
![]() |
wuhudsm | 2023-04-16 21:17:46 | 182 | ||
en23 |
![]() |
wuhudsm | 2023-04-16 21:12:46 | 124 | (published) | |
en22 |
![]() |
wuhudsm | 2023-04-16 21:09:40 | 13 | ||
en21 |
![]() |
wuhudsm | 2023-04-16 21:08:49 | 27 | ||
en20 |
![]() |
wuhudsm | 2023-04-16 21:06:41 | 1189 | (saved to drafts) | |
en19 |
![]() |
wuhudsm | 2023-04-16 20:55:34 | 0 | (published) | |
en18 |
![]() |
wuhudsm | 2023-04-16 20:54:15 | 15 | Tiny change: 'rial">\n\n1\n\n</spoi' -> 'rial">\n\ncoming soon...\n\n</spoi' | |
en17 |
![]() |
wuhudsm | 2023-04-16 20:53:35 | 446 | ||
en16 |
![]() |
wuhudsm | 2023-04-16 20:47:24 | 1299 | ||
en15 |
![]() |
wuhudsm | 2023-04-16 20:34:39 | 333 | ||
en14 |
![]() |
wuhudsm | 2023-04-16 20:29:12 | 238 | ||
en13 |
![]() |
wuhudsm | 2023-04-16 20:19:41 | 71 | ||
en12 |
![]() |
wuhudsm | 2023-04-16 20:17:51 | 173 | ||
en11 |
![]() |
wuhudsm | 2023-04-16 20:11:18 | 20 | Tiny change: 'L_1+1,R_1]>[L_1+2,R_' -> 'L_1+1,R_1]->[L_1+2,R_' | |
en10 |
![]() |
wuhudsm | 2023-04-16 20:09:05 | 15 | ||
en9 |
![]() |
wuhudsm | 2023-04-16 20:07:13 | 622 | ||
en8 |
![]() |
wuhudsm | 2023-04-16 19:58:15 | 188 | Tiny change: ' to find * max subsegment sum * and * mi' -> ' to find *max subsegment sum* and * mi' | |
en7 |
![]() |
wuhudsm | 2023-04-16 19:53:09 | 446 | ||
en6 |
![]() |
wuhudsm | 2023-04-16 19:29:11 | 195 | ||
en5 |
![]() |
wuhudsm | 2023-04-16 19:25:58 | 373 | ||
en4 |
![]() |
wuhudsm | 2023-04-16 19:15:03 | 116 | ||
en3 |
![]() |
wuhudsm | 2023-04-16 19:04:26 | 183 | ||
en2 |
![]() |
wuhudsm | 2023-04-16 18:59:36 | 422 | ||
en1 |
![]() |
wuhudsm | 2023-04-16 18:57:30 | 251 | Initial revision (saved to drafts) |
Name |
---|