zoukankan      html  css  js  c++  java
  • 紫书第三章训练 UVA 1584 Circular Sequence by 16 BobHuang

    Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequence ``CGAGTCAGCT", that is, the last symbol ``T" in ``CGAGTCAGCT" is connected to the first symbol ``C". We always read a circular sequence in the clockwise direction.

    Since it is not easy to store a circular sequence in a computer as it is, we decided to store it as a linear sequence. However, there can be many linear sequences that are obtained from a circular sequence by cutting any place of the circular sequence. Hence, we also decided to store the linear sequence that is lexicographically smallest among all linear sequences that can be obtained from a circular sequence.

    Your task is to find the lexicographically smallest sequence from a given circular sequence. For the example in the figure, the lexicographically smallest sequence is ``AGCTCGAGTC". If there are two or more linear sequences that are lexicographically smallest, you are to find any one of them (in fact, they are the same).

    Input 

    The input consists of T test cases. The number of test cases T is given on the first line of the input file. Each test case takes one line containing a circular sequence that is written as an arbitrary linear sequence. Since the circular sequences are DNA sequences, only four symbols, ACG and T, are allowed. Each sequence has length at least 2 and at most 100.

    Output 

    Print exactly one line for each test case. The line is to contain the lexicographically smallest sequence for the test case.

    The following shows sample input and output for two test cases.

    Sample Input 

    2                                     
    CGAGTCAGCT                            
    CTCC
    

    Sample Output 

    AGCTCGAGTC 
    CCCT
    又是AGCT,又是DNA,这不是运载体什么的环状DNA么,看样例读题意就是找到从环上那个点开始使它的字典序最小,这不是直接套string么,很短很易懂。
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main(){
     4 int t;
     5 cin>>t;
     6 while(t--){
     7     string s;
     8     cin>>s;
     9     string mi=s;
    10     for(int i=1;s[i];i++){
    11         string c=s.substr(i)+s.substr(0,i);
    12         if(mi>c)
    13             mi=c;
    14     }
    15     cout<<mi<<endl;
    16 }
    17 }
  • 相关阅读:
    js-高级06-正则
    js-高级05-javaScript处理机制
    js-高级04-函数高级应用
    js-高级03-面向对象的继承
    js-高级02-贪吃蛇案例分析
    js-高级01面向对象及创建对象
    js-API 06 高级动画二
    js-API 05 高级动画
    对象数组 数组对象 增删改查 数组
    jQuery ajax请求 一般请求和自定义请求
  • 原文地址:https://www.cnblogs.com/tzcacm/p/6801462.html
Copyright © 2011-2022 走看看