.又是一个美好的周三,竹子又逃课来写博客了,今天带来的还是CSES的题目
上题目!
- Time limit: 1.00 s
- Memory limit: 512 MB
A permutation of integers 1,2,…,n is called beautiful if there are no adjacent elements whose difference is 1.
Given n, construct a beautiful permutation if such a permutation exists.
Input
The only input line contains an integer n.
Output
Print a beautiful permutation of integers 1,2,…,n。If there are several solutions, you may print any of them. If there are no solutions, print "NO SOLUTION".
Constraints
- 1≤n≤10^6
Example 1
Input:5
Output:4 2 5 3 1
Example 2
Input:3
Output:NO SOLUTION
今天没有翻译
这道题就是说给你一个数n,要求输出一个包含数1~n的数列,数列中相邻两个数差不等于一
思路
这道题我第一次读题目的时候吃了一惊“好家伙,上一道还写个循环的事,这道突然就回溯了?”仔细想想好像没这么麻烦
这道题可以利用等差数列,先输偶数再输奇数,为了保证和样例一样(其实不一样也能过),竹子用的是先n-1然后n
废话完了,上代码
#include <bits/stdc++.h>
using namespace std;
int n;
int main(){
cin >> n;
if(n == 1){
cout << 1 << endl;
return 0;
}
if(n <= 3){
cout << "NO SOLUTION" << endl;
return 0;
}
for(int i = n - 1; i > 0; i -= 2){
cout << i << " ";
}
for(int i = n; i > 0; i -=2){
cout << i << " ";
}
return 0;
}
前面忘了说,数2,3是要特殊处理的~~~