zoukankan      html  css  js  c++  java
  • CF534A Exam 构造

    An exam for n students will take place in a long and narrow room, so the students will sit in a line in some order. The teacher suspects that students with adjacent numbers (i and i + 1) always studied side by side and became friends and if they take an exam sitting next to each other, they will help each other for sure.

    Your task is to choose the maximum number of students and make such an arrangement of students in the room that no two students with adjacent numbers sit side by side.

    Input

    A single line contains integer n (1 ≤ n ≤ 5000) — the number of students at an exam.

    Output

    In the first line print integer k — the maximum number of students who can be seated so that no two students with adjacent numbers sit next to each other.

    In the second line print k distinct integers a1, a2, ..., ak (1 ≤ ai ≤ n), where ai is the number of the student on the i-th position. The students on adjacent positions mustn't have adjacent numbers. Formally, the following should be true:|ai - ai + 1| ≠ 1 for all i from 1 to k - 1.

    If there are several possible answers, output any of them.

    Sample test(s)
    input
    6
    output
    6
    1 5 3 6 2 4
    input
    3
    output
    2
    1 3





    直接特判n<=4
    对于n>4,肯定是可以全部出来的
    构造:先输出所有奇数,再输出所有偶数
    如n=7,则输出:
    7
    1 3 5 7 2 4 6



    #include<cstdio>
    #include<iostream>
    
    using namespace std;
    
    int main()
    {
        int n;
        cin>>n;
        if(n==1 || n==2){
            cout<<"1
    1"<<endl;
        }
        else if(n==3){
            cout<<"2
    1 3"<<endl;
        }
        else if(n==4){
            cout<<"4
    2 4 1 3"<<endl;
        }
        else{
            cout<<n<<endl;
            for(int i=1;i<=n;i+=2)
                cout<<i<<" ";
            for(int i=2;i<=n;i+=2){
                cout<<i;
                if(i==n-1 || i==n)
                    cout<<endl;
                else
                    cout<<" ";
            }
        }
        return 0;
    }







  • 相关阅读:
    【转】5亿个数找中位数
    C++二维数组名的再探索
    转载 图像卷积
    PowerDesigner的使用一
    Spring注解详解
    JSP页面以及简单的指令
    Javascript学习总结
    html第一天
    Chrome开发,debug的使用方法。
    SVN使用
  • 原文地址:https://www.cnblogs.com/-maybe/p/4886732.html
Copyright © 2011-2022 走看看