C. Slava and tanks(思维)CodeForces 877C

B - B
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit Status Practice CodeForces 877C
use MathJax to parse formulas

Description

Slava plays his favorite game “Peace Lightning”. Now he is flying a bomber on a very specific map.

Formally, map is a checkered field of size 1 × n, the cells of which are numbered from 1 to n, in each cell there can be one or several tanks. Slava doesn’t know the number of tanks and their positions, because he flies very high, but he can drop a bomb in any cell. All tanks in this cell will be damaged.

If a tank takes damage for the first time, it instantly moves to one of the neighboring cells (a tank in the cell n can only move to the cell n - 1, a tank in the cell 1 can only move to the cell 2). If a tank takes damage for the second time, it’s counted as destroyed and never moves again. The tanks move only when they are damaged for the first time, they do not move by themselves.

Help Slava to destroy all tanks using as few bombs as possible.

Input

The first line contains a single integer n (2 ≤ n ≤ 100 000) — the size of the map.

Output

In the first line print m — the minimum number of bombs Slava needs to destroy all tanks.

In the second line print m integers k1, k2, …, km. The number ki means that the i-th bomb should be dropped at the cell ki.

If there are multiple answers, you can print any of them.

Sample Input
Input

2

Output

3
2 1 2

Input

3

Output

4
2 1 3 2
题意：输入n，有一个1×n的矩形，包括n个格子，一个人在空中扔炮弹，扔第一次坦克不会被炸死，而是左右移动，但是并不能看见坦克是往哪移动的，请帮助斯拉瓦摧毁所有坦克使用尽可能少的炸弹。
思路：这个题一直被我理解错了，以为要求最少的次数，应该是n+1次，这样就必须得控制坦克的移动方向了，然而这个题目是无法控制坦克的移动方向的。先往偶数格上投，再往奇数格子上投，再往偶数格子上投，务必会使这两个坦克都死，，这才是尽可能少的子弹
Code :

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<set>
#include<map>
#include<vector>
#include<cmath>
using namespace std;
#define ll long long
#define MAX 100000

int main()
{
    int n;
    ios::sync_with_stdio(false);
    cin>>n;
    cout<<n+n/2<<endl;
    for(int i=2; i<=n; i+=2)  cout <<i<<" ";
    for(int i=1; i<=n; i+=2)  cout <<i<<" ";
    for(int i=2; i<=n; i+=2)  cout <<i<<" ";


    return 0;
}