关闭

UVA-1584 - Circular Sequence

181人阅读 评论(0) 收藏 举报
分类:

/***************************************/

简单题,小白,第一次写博客,寻找字典排序的最小,直接枚举所有的情况放到容器中,然后sort正向排序后输出最小的那个就好了。

可用substr(size_type index)截取字符串实现字符串环。

/***************************************/

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.

\epsfbox{p3225.eps}

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, A, C, G 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.



//题解

#include <iostream>
#include <string>
#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

int T;
string s;

int main()
{
    scanf("%d", &T);
    while(T--)
    {
        cin>> s;
        int s_length = s.length();
        vector<string> v(s_length);//存储所有可能的序列
        for(int i = 0; i < s_length; ++i)
        {
            v[i] = s.substr(i) + s;
            v[i].erase(s_length);
        }
        sort(v.begin(), v.end());
        cout<<v[0]<<endl;
    }
    return 0;
}


0
0
查看评论

UVa-1584 Circular Sequence

#include<iostream> #include<cstdio> #include<cstring> using namespace std; bool cmp(char a[],int p,int q,int k) { for(int i=0;i&...
  • windrises
  • windrises
  • 2015-02-14 03:17
  • 230

UVA-1584 Circular Sequence

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 “C...
  • yvetteweiss
  • yvetteweiss
  • 2017-02-26 15:13
  • 125

环装序列(circular sequence)

长度为n的换证串有n种表示法,分别为从某个位置开始顺时针得到。例如图: 有10种表示:CGAGTCAGCT,GAGTCAGCTC,AGTCAGCTCG等。在这些表示法中,字典序最小的成为“最小表示”。 输入一个长度为n(n 本题出现了一个新概念,字典序。就是字符串在字典中的顺序。一般对于两个字...
  • sayniceoh
  • sayniceoh
  • 2016-11-15 19:08
  • 165

Uva1508 Circular Sequence 环状序列

最近一直在看刘汝佳的书上例题 惊喜发现uva贴心 把他上面的题专门 做了一个整理 以后就刷uva #include #include #include using namespace std; #define M 105 int moreless...
  • yexiaohhjk
  • yexiaohhjk
  • 2015-04-01 20:20
  • 498

环状序列

/*环状序列  *求最小表示--字典序最小(一般对于两个字符串,从第一个字符开始比较,当某一个位置的字符不同时,该位置字符较小的串,字典序较小。  *如果其中一个字符串已经没有更多的字符,但另一个字符还没结束,则较短的字符串字典序较小)  */  /*...
  • u013747277
  • u013747277
  • 2014-10-12 13:21
  • 397

Circular Sequence

Problem Description Given a sequence with n elements, if the last element is also adjacent to the first element of the sequence, the sequence is ca...
  • u011123263
  • u011123263
  • 2014-05-07 15:20
  • 363

UVA 1584 - Circular Sequence(环状序列)(字典序)

1584 - Circular Sequence Time limit: 3.000 seconds Some DNA sequences exist in circular forms as in the following figure, which shows a circular s...
  • huatian5
  • huatian5
  • 2016-05-08 18:55
  • 1554

Circular Sequence—UVa1584

注意字典序的定义
  • yyzsir
  • yyzsir
  • 2018-02-03 15:55
  • 24

uva1584 Circular Sequence

#include #include #include using namespace std; string s[10010]; int change1(char ch) {     if(ch=='A') retur...
  • qq_33901573
  • qq_33901573
  • 2016-04-10 20:12
  • 169

Circular Sequence UVA - 1584

问题类型:循环数组,字典序。03pie’s solution for [UVA-1584]:#include<cstdio> #include<iostream> #include<sstream> #include<cstdlib> #include...
  • qq_34677945
  • qq_34677945
  • 2017-04-03 12:41
  • 334
    个人资料
    • 访问:24156次
    • 积分:698
    • 等级:
    • 排名:千里之外
    • 原创:47篇
    • 转载:6篇
    • 译文:0篇
    • 评论:1条
    文章分类