The problem calls digits in integer number "special" if they are "local maximum" (2 points) or "minimum" (1 point) among neighbors. And asks to calculate points for all numbers in a given range. It won't be hard for bruteforce if ranges are not on order 10^18 :) Thus it is most probable some kind of DP but I'm completely out of ideas how exactly to approach it. If someone can give such a subtle hint as direct me without spoiling the solution, it would be great!
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 08:24:13 (f1).
Desktop version, switch to mobile version.
Supported by
Digit Dp
try to calculate it for all numbers from 0 till n1 and 0 till n2 and substract them for the answer in the range
let a be the first digit , b be the second digit and c be the third digit
we will have to add 2 when a < b and b > c or we will have to add 1 when a > b and b < c in the dp try to do something with this