#### Hello,↵
↵
Problem [The Number of Sub permutations](https://codeforces.net/contest/1175/problem/F) solve by problem [k-d-sequence](https://codeforces.net/contest/407/problem/E) but in that case k = 0 and d = 1 and you count number of contiguous subsegments with a minimum number of one
↵
Problem [The Number of Sub permutations](https://codeforces.net/contest/1175/problem/F) solve by problem [k-d-sequence](https://codeforces.net/contest/407/problem/E) but in that case k = 0 and d = 1 and you count number of contiguous subsegments with a minimum number of one
