多多色-多人伦交性欧美在线观看-多人伦精品一区二区三区视频-多色视频-免费黄色视屏网站-免费黄色在线

國內(nèi)最全IT社區(qū)平臺 聯(lián)系我們 | 收藏本站
阿里云優(yōu)惠2
您當前位置:首頁 > php開源 > B. MUH and Important Things(Codeforces Round #269)

B. MUH and Important Things(Codeforces Round #269)

來源:程序員人生   發(fā)布時間:2014-09-29 08:57:55 閱讀次數(shù):3291次
B. MUH and Important Things
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

It's time polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got down to business. In total, there are n tasks for the day and each animal should do each of these tasks. For each task, they have evaluated its difficulty. Also animals decided to do the tasks in order of their difficulty. Unfortunately, some tasks can have the same difficulty, so the order in which one can perform the tasks may vary.

Menshykov, Uslada and Horace ask you to deal with this nuisance and come up with individual plans for each of them. The plan is a sequence describing the order in which an animal should do all the n tasks. Besides, each of them wants to have its own unique plan. Therefore three plans must form three different sequences. You are to find the required plans, or otherwise deliver the sad news to them by stating that it is impossible to come up with three distinct plans for the given tasks.

Input

The first line contains integer n (1?≤?n?≤?2000) ― the number of tasks. The second line contains n integers h1,?h2,?...,?hn (1?≤?hi?≤?2000), where hi is the difficulty of the i-th task. The larger number hi is, the more difficult the i-th task is.

Output

In the first line print "YES" (without the quotes), if it is possible to come up with three distinct plans of doing the tasks. Otherwise print in the first line "NO" (without the quotes). If three desired plans do exist, print in the second line n distinct integers that represent the numbers of the tasks in the order they are done according to the first plan. In the third and fourth line print two remaining plans in the same form.

If there are multiple possible answers, you can print any of them.

Sample test(s)
input
4 1 3 3 1
output
YES 1 4 2 3 4 1 2 3 4 1 3 2
input
5 2 4 1 4 8
output
NO
Note

In the first sample the difficulty of the tasks sets one limit: tasks 1 and 4 must be done before tasks 2 and 3. That gives the total of four possible sequences of doing tasks : [1, 4, 2, 3], [4, 1, 2, 3], [1, 4, 3, 2], [4, 1, 3, 2]. You can print any three of them in the answer.

In the second sample there are only two sequences of tasks that meet the conditions ― [3, 1, 2, 4, 5] and [3, 1, 4, 2, 5]. Consequently, it is impossible to make three distinct sequences of tasks.


代碼:

#include <iostream> #include <cstdio> #include <cstring> #include <vector> using namespace std; vector<int> son[2014]; int main() { int n; scanf("%d",&n); int x; for(int i=1;i<=n;i++) { scanf("%d",&x); son[x].push_back(i); } int coun=0; int sign=0; for(int i=1;i<=2000;i++) { if(son[i].size()==2) { coun+=2; } if(son[i].size()>2) { sign=i; coun+=4; break; } } if(coun>=3) { printf("YES "); int cr=1; for(int i=1;i<=2000;i++) { for(int j=0;j<son[i].size();j++) { if(cr) { cr=0; printf("%d",son[i][j]); } else printf(" %d",son[i][j]); } } printf(" "); if(sign) { cr=1; for(int i=1;i<=2000;i++) { for(int j=0;j<son[i].size();j++) { if(i==sign&&(j==0||j==1)) { if(cr) { cr=0; printf("%d",son[i][1-j]); } else printf(" %d",son[i][1-j]); } else { if(cr) { cr=0; printf("%d",son[i][j]); } else printf(" %d",son[i][j]); } } } printf(" "); cr=1; for(int i=1;i<=2000;i++) { for(int j=0;j<son[i].size();j++) { if(i==sign&&(j==0||j==1||j==2)) { if(cr) { cr=0; printf("%d",son[i][2-j]); } else printf(" %d",son[i][2-j]); } else { if(cr) { cr=0; printf("%d",son[i][j]); } else printf(" %d",son[i][j]); } } } printf(" "); } else { int gt=0; cr=1; for(int i=1;i<=2000;i++) { for(int j=0;j<son[i].size();j++) { if(son[i].size()==2&&(j==0||j==1)) { gt=i; if(cr) { cr=0; printf("%d",son[i][1-j]); } else printf(" %d",son[i][1-j]); } else { if(cr) { cr=0; printf("%d",son[i][j]); } else printf(" %d",son[i][j]); } } } printf(" "); cr=1; for(int i=1;i<=2000;i++) { for(int j=0;j<son[i].size();j++) { if(son[i].size()==2&&(j==0||j==1)&&i!=gt) { if(cr) { cr=0; printf("%d",son[i][1-j]); } else printf(" %d",son[i][1-j]); } else { if(cr) { cr=0; printf("%d",son[i][j]); } else printf(" %d",son[i][j]); } } } printf(" "); } } else { printf("NO "); } return 0; }



生活不易,碼農(nóng)辛苦
如果您覺得本網(wǎng)站對您的學習有所幫助,可以手機掃描二維碼進行捐贈
程序員人生
------分隔線----------------------------
分享到:
------分隔線----------------------------
關閉
程序員人生
主站蜘蛛池模板: 日韩理论片在线观看 | 69视频在线播放 | 午夜视频你懂的 | 在线国产小视频 | 日韩一级欧美一级毛片在 | xxxxxx日本处大片免费看 | free性欧美极度另类3d | 日韩欧美成末人一区二区三区 | 精品无码久久久久久久动漫 | 三级做爰大爽长视频在线观看 | 亚洲天堂一区二区三区四区 | 国产成人久久综合二区 | 日韩a级毛片免费视频 | 日韩欧美手机在线 | 国产成人a | 女人18毛片a级毛片一区二区 | 欧美一区二区三区香蕉视 | 毛片三级在线观看 | 99久久综合狠狠综合久久aⅴ | 免费观看美女的网站 | 国产精品国产三级国产专区5o | 亚洲精品高清在线 | 第一福利在线观看永久视频 | 高清一区二区三区四区五区 | free性欧美人与牛 | 亚洲欧美小说图片 | 国产精品欧美日韩精品 | 最近的最新的中文字幕视频 | 欧美成人一区二区三区不卡视频 | 亚洲在线第一页 | 国产成人咱精品视频免费网站 | 欧美xxxx极品流血 | 国产一国产一区秋霞在线观看 | 成人做爰免费视频免费看 | 日本一区二区三区四区不卡 | 能看毛片的网址 | 国产又黄又爽又色的免费 | 国产视频日本 | 亚洲精品一区二区中文 | 激情爽毛片私人影院 | h网址在线观看 |