Given n, how can we construct a permutation p of size n, such that the sum of p[i]/i is minimized?
# | User | Rating |
---|---|---|
No items |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 164 |
2 | Um_nik | 163 |
3 | cry | 159 |
3 | atcoder_official | 159 |
5 | adamant | 157 |
5 | awoo | 157 |
5 | -is-this-fft- | 157 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
The permutation that minimizes the sum of floor(p[i]/i)
Given n, how can we construct a permutation p of size n, such that the sum of p[i]/i is minimized?
Name |
---|