void_cpp1 于 2016.03.13 16:17 提问

ACM的小伙伴进，uva-1584有些小问题求大神解惑

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.

Sample Input

2

CGAGTCAGCT

CTCC
Sample Output

AGCTCGAGTC
CCCT

``````#include <iostream>
#include <cstring>
using namespace std;
int small(const char* s,int p,int q);
#define maxn 105
int main()
{
int n;//测试数
cin>>n;
while(n--){
//为何不能用char *str={0};？
char str[maxn];
cin>>str;
int len=strlen(str);
int ans=0;
for(int i=1;i<len;i++){
if(small(str,i,ans))
ans=i;
}
for(int i=0;i<len;i++){
putchar(str[(ans+i)%len]);
}
putchar('\n');
}
return 0;

}

int small(const char* s,int p,int q){  //比较表示法p和表示法q字典序大小
int n=strlen(s);
for(int i=0;i<n;i++){
if(s[(p+i)%n]!=s[(q+i)%n])
return s[(p+i)%n]<s[(q+i)%n];
}
return 0;

}

``````

1个回答

leilba   2016.03.13 17:37

`````` char *str={0};
cin>>str;
``````

`````` char *str = new char[maxn];
cin>>str;
``````
void_cpp1 谢谢，我明白了
2 年多之前 回复

ACM大神之路自述

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<k;i++) { if(a[(p+i)%k]<a[(q+i)%k]) return 1;
UVA-1584 - Circular Sequence
/***************************************/ 简单题，小白，第一次写博客，寻找字典排序的最小，直接枚举所有的情况放到容器中，然后sort正向排序后输出最小的那个就好了。 可用substr(size_type index)截取字符串实现字符串环。 /***************************************/ Some DNA seq
UVA-1584 Circular Sequence
Some DNA sequences exist in circular forms as in the following ﬁgure, which shows a circular sequence “CGAGTCAGCT”, that is, the last symbol “T” in “CGAGTCAGCT” is connected to the ﬁrst symbol “C”. We

#include #include using namespace std; const long long great = 1000000007; bool isSame(long long a, long long b, long long c) { if (a == b && b == c) return true; if (a == b) return false;

【期望】acm题目