zoukankan      html  css  js  c++  java
  • NYOJ283对称排序

    对称排序

    时间限制:1000 ms  |  内存限制:65535 KB
    难度:1
     
    描述
    In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by length (so that each name is at least as long as the one preceding it). However, your boss does not like the way the output looks, and instead wants the output to appear more symmetric, with the shorter strings at the top and bottom and the longer strings in the middle. His rule is that each pair of names belongs on opposite ends of the list, and the first name in the pair is always in the top part of the list. In the first example set below, Bo and Pat are the first pair, Jean and Kevin the second pair, etc. 
     
    输入
    The input consists of one or more sets of strings, followed by a final line containing only the value 0. Each set starts with a line containing an integer, n, which is the number of strings in the set, followed by n strings, one per line, NOT SORTED. None of the strings contain spaces. There is at least one and no more than 15 strings per set. Each string is at most 25 characters long. 
    输出
    For each input set print "SET n" on a line, where n starts at 1, followed by the output set as shown in the sample output.
    If length of two strings is equal,arrange them as the original order.(HINT: StableSort recommanded)
    样例输入
    7
    Bo
    Pat
    Jean
    Kevin
    Claude
    William
    Marybeth
    6
    Jim
    Ben
    Zoe
    Joey
    Frederick
    Annabelle
    5
    John
    Bill
    Fran
    Stan
    Cece
    0
    样例输出
    SET 1
    Bo
    Jean
    Claude
    Marybeth
    William
    Kevin
    Pat
    SET 2
    Jim
    Zoe
    Frederick
    Annabelle
    Joey
    Ben
    SET 3
    John
    Fran
    Cece
    Stan
    Bill
     1  
     2 #include <iostream>
     3 #include <cstring>
     4 #include <string>
     5 #include <algorithm>
     6 using namespace std;
     7 string str1[26],str2[26];
     8 bool cmp(string a,string b)
     9 { 
    10  return a.length()<b.length();
    11 }
    12 int main()
    13 {
    14  int n,i,j,k,t=1;
    15  while(cin>>n,n)
    16  {
    17   j=0;k=n-1;
    18   for( i = 0 ; i < n ; i ++ )
    19   cin>>str1[i];
    20   sort(str1,str1+n,cmp);
    21   for( i = 0 ; i < n ; i ++ )
    22   {
    23    if( i & 1 == 0 )
    24    str2[j++] = str1[i];
    25    else
    26    str2[k--] = str1[i];
    27   }
    28   cout<<"SET "<<t++<<endl;
    29   for(i=0;i<n;i++)
    30   cout<<str2[i]<<endl;
    31  }
    32  return 0;
    33 }
    34         
  • 相关阅读:
    【转】 Android代码混淆之混淆规则
    【转】java虚拟机机制总结
    【转】图解 HTTP协议/IIS 原理及ASP.NET运行机制浅析
    【转】Android 消息机制
    Android-eclipse-NDK&JNI
    【转】大型网站系统架构的演化
    【转】Android开发必知--WebView加载html5实现炫酷引导页面
    【转】Java虚拟机详解----GC算法和种类
    网页中缩略图的意义
    网页开关灯效果
  • 原文地址:https://www.cnblogs.com/zhaojiedi1992/p/zhaojiedi_2012_08_020000.html
Copyright © 2011-2022 走看看