环状序列UVa1584紫苏第三章

原创 2015年11月19日 23:27:36

Description

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, 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


题意就是输出最小的环状串。


代码如下

#include  
#include  
using namespace std;  
const int N = 150;  
char a[N], ans[N], c;  
int t, len;  
  
int main()  
{  
    scanf ("%d", &t);  
    while (t--)  
	{
		scanf("%s",a);
		strcpy(ans,a);
		len=strlen(a);
		for(int i=0;i=1;j--)
			{
				ans[j]=ans[j-1];
			}
			ans[0]=c;
			
			if(strcmp(ans,a)<0) strcpy(a,ans);
    	}
    	printf("%s\n",a);
	  }  
	  return 0;
} 

思路就是将环状串数组最后一位放到第一位,然后和原数组比较大小,类似于冒泡排序,不断更新a,最终循环结束,a是最小的环状串。

博客已搬:洪学林博客

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

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

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

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

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

uva1584_水题(环状串的处理)

我的方法是:用指针不断从头部向尾部转移值; 大白代码仓库中方法:利用模运算;My Code:#include #include #include #include /////////////////...
  • tt2767
  • tt2767
  • 2015年08月20日 20:12
  • 571

20160321 UVa RUJIA 算法竞赛入门经典:镜像回文,生成元,环状序列

算法竞赛入门经典:镜像回文,生成元,环状序列

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

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

UVa - 1584:Circular Sequence

长度为n的环状串有n种表示法,分别为从某个位置开始顺时针得到。例如,下图的环状串有10种表示:CGAGTCAGCT,GAGTCAGCTC,AGTCAGCTCG等。在这些表示法中,字典序最小的称为“最小...
  • wingrez
  • wingrez
  • 2017年07月19日 16:32
  • 87

环状序列 算法竞赛入门经典

题目描述: Description Some DNA sequences exist in circular forms as in the following figure, whi...

UVA-1584 Circular Sequence

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

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)
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:环状序列UVa1584紫苏第三章
举报原因:
原因补充:

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