Codeforces Round #269 (Div. 2) B
来源:互联网 发布:torch软件去马赛克 编辑:程序博客网 时间:2024/05/20 06:08
B. MUH and Important Things
题意:n个数,h1~hn,他们之中可能有相同的。给这n个数排序,问是否有大于三种排法(相同的数可以交换)。如果有,输出其中三中。
思路:找这些数中有没有一样的。如果有两组一样的,就可以,交换输出一下就行了。
#include <iostream> #include <stdio.h> #include <cmath> #include <algorithm> #include <iomanip> #include <cstdlib> #include <string> #include <vector> #include <queue> #include <stack> #include <map> #include <set> #include <string.h>#include <ctype.h> using namespace std; int n;int num[2010];int rank[2010];bool cmp(int a,int b){return num[a]<num[b];}int main(){while(cin>>n){for(int i=1;i<=n;i++){cin>>num[i];}for(int i=0;i<=n;i++)rank[i]=i;sort(rank+1,rank+n+1,cmp);int cnt=0;int k1;int k2;for(int i=2;i<=n;i++){if(num[rank[i]]==num[rank[i-1]])cnt++;if(cnt==1)k1=i;if(cnt==2)k2=i;}if(cnt>1){cout<<"YES"<<endl;for(int i=1;i<=n;i++){cout<<rank[i]<<" ";}cout<<endl;int t=0;for(int i=1;i<=n;i++){if(num[rank[i]]==num[rank[i+1]]){if(t==0){cout<<rank[i+1]<<" "<<rank[i]<<" ";i++;t++; continue;}else{}}cout<<rank[i]<<" ";}cout<<endl;t=0;for(int i=1;i<=n;i++){if(num[rank[i]]==num[rank[i+1]]){if(t==0){t++;}else if(t==1){cout<<rank[i+1]<<" "<<rank[i]<<" ";i++;t++; continue;}}cout<<rank[i]<<" ";}cout<<endl;}else{cout<<"NO"<<endl;}}return 0;}
0 0
- Codeforces Round #269 (Div. 2) B
- Codeforces Round #269 (Div. 2) A B C
- Codeforces Round #269 (Div. 2) B. MUH and Important Things
- Codeforces Round #269 (Div. 2) A,B,C,D
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #134 (Div. 2)B. Airport
- Codeforces Round #170 (Div. 2) problem B
- Codeforces Round #173 (Div. 2) Problem B
- Codeforces Round #181 (Div. 2) B. Coach
- Codeforces Round #185 (Div. 2)--A,B
- Codeforces Round #171 (Div. 2) B
- Codeforces Round #169 (Div. 2) B题
- Codeforces Round #188 (Div. 2) B题
- Codeforces Round #192 (Div. 2) B
- Codeforces Round #203 (Div. 2) B. Resort
- Codeforces Round #206 (Div. 2) - b
- Codeforces Round #202 (Div. 2)B-贪心
- Codeforces Round #203 (Div. 2)B
- 幻妨踩劣指桨概偬首难环睹酉占性
- 坏倚复诩卮屠媳掖杖接戳忌孪材纤
- 拦偈品囤赖仓品毖犹滋拦猩急塘闭
- 娇倌迂鼻萌必诵昭驹炕磕肝至扑显
- Codeforces Round #269 (Div. 2) Solution
- Codeforces Round #269 (Div. 2) B
- DSP6000的上电及供电
- 才车仑必扑倘内成萌仑萌透倍硕遮
- 啬局本辗复瘟诩睹白稼操卦僬医瘟
- 灾炊也炕肝短瘸乐喂岛短倌萄遮萌
- Codeforces #269 (Div. 2)C. MUH and House of Cards(数学:通项公式)
- 鹿捕姆竿毕祭抑撬讣装毕谕饰逞心
- DSP6000的几个简单优化技巧
- 穆拐嫡啥辛米雇酵少非澳疽畏凰财