Hello Codeforces Community, Here are the editorials for today's held Google Kickstart Round B 2021. Each and every problem along with their solutions are explained in detail.
Below are the links to the solutions:-
Last problem will be updated soon.
Any suggestions are welcome, do comment in this blog post.
Thank You!!
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Your Explanation for Longest Progression is Awesome. Thanks a lot.
thanks for the solutions ^_^
in longest progression problem the answer of the second testcase is 6.......................... 5 5 4 5 5 5 4 5 6 -> 5 5 5 5 5 5 4 5 6(by changing the 3rd element) but if the 5th element is changed to 4 then we can get the max length 8................ 5 5 4 5 4 5 4 5 6(by changing the 5th element to 4) from 2nd to last element the difference is 1 and length is 8
We can't get 8 as the maximum possible answer. Note that the definition of arithmetic array says the difference b/w adjacent elements(consider forward-backward). If the question says that we have to consider the absolute value of difference b/w adjacent elements then our answer for this test case would be 8, otherwise, 6 is the correct answer for this TC.