每日一题E 2015/6/2 21:50
来源:互联网 发布:淘宝全屏导航不固定 编辑:程序博客网 时间:2024/05/19 01:33
#include<stdio.h>#include<math.h>#include<stdlib.h>int main(){ int n; scanf("%d", &n); int a[5005] = {0}; int b[5005] = {0}; int i; int j; if( n == 4) { printf("4\n"); printf("3 1 4 2"); } else if( n == 3) { printf("2\n"); printf("1 3"); } else if( n == 2) { printf("1\n"); printf("1"); } else if(n == 1) { printf("1\n"); printf("1"); } else { for(i = 0, j = 1 ; j <= (n +1 )/ 2 ; i += 2, j++) { a[i] = j; } for(i = 1; j <= n; j++, i+=2 ) { a[i] = j; } for(i = 0 ; a[i] != 0; i++); printf("%d\n", i); for(i = 0 ; a[i] != 0; i++) { printf("%d ",a[i]); } } return 0;}
</pre><pre>
Description
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 tok - 1.
If there are several possible answers, output any of them.
Sample Input
6
61 5 3 6 2 4
3
21 3
- 每日一题E 2015/6/2 21:50
- 每日一题E
- 每日一题F 2015/6/2 21:30
- 每日一题2
- 每日一题(6):
- 每日一题(2):
- 每日一题B 2015-6-1 13:23
- 每日一题C 2015-6-1 17:09
- 每日一题D 2015-6-1 17:34
- 每日一题G 2015/6/3 16:38
- Sql Server每日一练-利用SQL发E-MAIL
- 每日一题(21) - 编写memmove 函数
- 算法每日一题:6、反序数
- 面试—每日一题(6)
- 每日一题6:位图向量排序
- leetcode每日一题:(6)ZigZag Conversion
- 【每日一题(6)】Div. 64 CodeForces
- 每日一练21
- Java基础知识之Set
- 我是菜鸟:java异常处理总结
- Linux IPC 之管道通信
- 理解Java对象序列化
- 希尔排序
- 每日一题E 2015/6/2 21:50
- 凯云水利水电工程造价系统 (五) 补充定额
- 占位符的另一种用处
- MC 通信协议@2015/06/02
- 黑马程序员——Java基础---语法<一>
- 2.工厂方法模式
- 谱聚类--SpectralClustering
- VMware中Ubuntu 14.04出现Unknown Display问题解决
- Windows 10 预览版 VMware虚拟机 安装教程