Gluttony(codeforce-891B)
来源:互联网 发布:windows平板电脑 编辑:程序博客网 时间:2024/05/22 20:53
You are given an array a with n distinct integers. Construct an array b by permuting a such that for every non-empty subset of indices S = {x1, x2, ..., xk} (1 ≤ xi ≤ n, 0 < k < n) the sums of elements on that positions in a and b are different, i. e.
The first line contains one integer n (1 ≤ n ≤ 22) — the size of the array.
The second line contains n space-separated distinct integers a1, a2, ..., an (0 ≤ ai ≤ 109) — the elements of the array.
If there is no such array b, print -1.
Otherwise in the only line print n space-separated integers b1, b2, ..., bn. Note that b must be a permutation of a.
If there are multiple answers, print any of them.
题意理解:给你一个a数组,让你构造一个b数组,使得b数组的任意连续k项加起来,都和a数组不一样。
解题思路: 我们让给a数组排个序,使b数组的元素对应位,为第一个比a对应位小的元素,如果是最小值,那么就用最大值替换,这样就能保证完全的不同。
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;;int a[50],p[50],b[50];bool cmp(int x,int y){return a[x]<a[y];}int main(){ int n;scanf("%d",&n);for (int i=0;i<n;i++){scanf("%d",&a[i]);p[i]=i;}sort(p,p+n,cmp);for (int i=0;i<n-1;i++){b[p[i+1]]=a[p[i]];}b[p[0]]=a[p[n-1]];for (int i=0;i<n;i++){printf("%d ",b[i]);} return 0;}
- Gluttony(codeforce-891B)
- codeforces 891 B. Gluttony(构造)
- codeforces 891B Gluttony (构造+思维)
- [Codeforces 891B] Gluttony
- Codeforces 891B Gluttony 构造
- codeforces -891B Gluttony 排列,构造题
- codeforces -891B Gluttony 排列,构造题
- codeforce 777B(水)
- codeforce 893B (模拟)
- CodeForce 3B Lorry(贪心)
- codeforce 329B Biridian Forest(bfs)
- codeforce 3B. Lorry(贪心)
- Codeforce 741B (XOR运算)
- codeforce 4B(思维水题)
- CodeForce 124B Permutations(水题)
- Codeforces 892 D. Gluttony (思维)
- Codeforce # B Sequence Formatting
- codeforce 298 B Sail
- 多线程下载视频
- numpy.core.multiarray failed to import
- Java线程状态转换
- 朴素贝叶斯(Naive Bayes),“Naive”在何处?
- 传入当前的经纬度和目标经纬度,计算两点间距离
- Gluttony(codeforce-891B)
- Apache HttpComponents
- springMvc+Mybatis整合
- sublime使用技巧
- Windows下安装TensorFlow教程
- lintcode---搜索二维矩阵Ⅱ
- [LeetCode]Maximum Gap
- uva 10294 置换群 Polya定理
- SpringMVC中的参数绑定总结