UVA-1584 - Circular Sequence

原创 2015年11月20日 22:47:39

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

简单题,小白,第一次写博客,寻找字典排序的最小,直接枚举所有的情况放到容器中,然后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;
}


版权声明:菜鸟进阶,请多指教。

相关文章推荐

UVA-1584 Circular Sequence

Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequenc...

环装序列 (Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)

长度为n的环状串有n种表示法,分别为某个位置开始顺时针得到。例如,图中的环状串有10种表示: CGAGTCAGCT,GAGTCAGCTC,AGTCAGCTCG等。在这些表示法中,字典序最小的称为...

UVA 1584 Circular Sequence

1584 - Circular Sequence Some DNA sequences exist in circular forms as in the following figure, w...

UVa 1584 Circular Sequence(循环串 字典序)

每次后移一位比较字典序即可  注意不能用strcpy(s+1,s)

uva_1584_Circular Sequence

Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequen...

《算法竞赛入门经典2ndEdition 》例题3-6 环状序列(Circular Sequence, Uva1584)

WA了很多次,最后发现是因为把s,min数组定义在了for循环内,好吧,终于AC了。...

UVa 1584 Circular Sequence 【数组和字符串】

Time limit: 3.000 seconds Description Some DNA sequences exist in circular forms as in the following...

UVa 1584 Circular Sequence / 455 Periodic Strings(枚举字符串)

原题地址https://vjudge.net/problem/UVA-1584 题意:DNA的四个字母CGAT排列成环形,可以移动起点,输出字典序最小的环形序列(顺时针)。 解题思路这道题是《算法...

UVA 1584 Circular Sequence【字典序】

Circular Sequence   Status Description Download as PDF Some DNA sequences exist in circular f...

环状序列(Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)

长度为n的环状串有n种表示法,分别为从某个位置开始顺时针得到。例如,图3-4的环状串有10种表示:CGAGTCAGCT,GAGTCAGCTC,AGTCAGCTCG等。在这些表示法中,字典序最小的称为”...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:UVA-1584 - Circular Sequence
举报原因:
原因补充:

(最多只允许输入30个字)