Hello,
Problem The Number of Sub permutations solve by problem k-d-sequence but in that case k = 0 and d = 1 and you count number of contiguous subsegments with a minimum number of one
# | User | Rating |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
Problem The Number of Sub permutations
Problem The Number of Sub permutations solve by problem k-d-sequence but in that case k = 0 and d = 1 and you count number of contiguous subsegments with a minimum number of one
Name |
---|