Codeforces 482 - Diverse Permutation 构造题

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define ll long long
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))
using namespace std;
const int INF = 0x3f3f3f3f;

int a[100001];

int main(){
    int i, j, k, t, m, n;
    while(EOF != scanf("%d%d",&n,&k)){
        if(k == 1){
            for(i = 1; i < n; ++i)  printf("%d ",i);
            printf("%d\n",n);
            continue;
        }

        a[1] = 1 + k;
        for(i = 2; i <= k + 1; ++i){
            if(i % 2 == 0)
                a[i] = a[i - 1] - (k - (i - 2));
            else
                a[i] = a[i - 1] + (k - (i - 2));
        }
        int cur = 1;
        for(i = k + 2; i <= n; ++i){
            a[i] = k + 1 + cur++;
        }
        for(i = 1; i < n; ++i){
            printf("%d ",a[i]);
        }
        printf("%d\n",a[n]);
    }
    return 0;
}