【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B】Shashlik Cooking

【链接】 我是链接,点我呀:)

【题意】

在这里输入题意

【题解】

翻转一次最多影响2*k+1个地方。
如果n

【代码】

#include <bits/stdc++.h>
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define lson l,mid,rt<<1
#define ri(x) scanf("%d",&x)
#define rl(x) scanf("%lld",&x)
#define rs(x) scanf("%s",x)
#define rson mid+1,r,rt<<1|1
using namespace std;
const double pi = acos(-1);
const int dx[4] = {0,0,1,-1};
const int dy[4] = {1,-1,0,0};
const int N = 20;
int n,k;
int main(){
	#ifdef LOCAL_DEFINE
	    freopen("rush_in.txt", "r", stdin);
	#endif
	scanf("%d%d",&n,&k);
    if (k+1>=n){
        cout<<1<<endl;
        cout<<1<<endl;
        return 0;
    }else if (2*k+1>=n){
        //n>k+1
        cout<<1<<endl;
        cout<<k+1<<endl;
        return 0;
    }
    int temp = n%(2*k+1);
    int points = n/(2*k+1);
    if (temp==0){
        printf("%d\n",points);
        int x = k+1;
        rep1(i,1,points){
            cout<<x<<' ';
            x = x+k+1+k;
        }
    }else {
        if (temp>=k+1){
            points++;
            cout<<points<<endl;
            int x = temp-k;
            rep1(i,1,points){
                cout<<x<<' ';
                x = x + k+1+k;
            }
        }else{
            //temp<=k
            points++;
            cout<<points<<endl;
            cout<<1<<' ';
            points--;
            int x = 1;
            rep1(i,1,points){
                x = x+k+1+k;
                cout<<x<<' ';
            }
        }
    }
	return 0;
}