Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as nthe length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, that the group of numbers |p1 - p2|, |p2 - p3|, ..., |pn - 1 - pn| has exactly k distinct elements.
The single line of the input contains two space-separated positive integers n, k (1 ≤ k < n ≤ 105).
Print n integers forming the permutation. If there are multiple answers, print any of them.
3 2
1 3 2
3 1
1 2 3
5 2
1 3 2 4 5
By |x| we denote the absolute value of number x.
题目大意:
给出n和k,要求输出1~n之间的数字的排列组合,并且要求a[i]-a[i-1]有K个不同的值
解法:
很简单的一个构造题。
首先我们可以想到1与1+k为k的差距,1+k与2是k-1的差距,2与k之间的差距是k-2。发现1~1+k之间,我们可以构造出1~k的差值,一下就符合了题意,然后1+k之后按顺序输出(差值都为1)。
代码:
#include <cstdio>
int n, k, pos;
void init() {
scanf("%d%d", &n, &k);
}
void solve() {
pos = 1;
printf("%d", pos);
for (int i = 1; i <= k; i++) {
if (i%2)
pos += k-i+1;
else
pos -= k-i+1;
printf(" %d", pos);
}
for (int i = 2+k; i <= n; i++) printf(" %d", i);
printf("\n");
}
int main() {
init();
solve();
}