UVa 1548 Circular Sequence (字符串处理)
2015-01-18 15:27
381 查看
Circular Sequence
Submit Status
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.
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).
The following shows sample input and output for two test cases.
Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
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.
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 <string.h> #include <stdio.h> #define maxn 105 using namespace std; int less1(const char *s ,int p,int q){ int n = strlen(s); for(int i = 0; i < n;i++){ if(s[(q+i)%n] != s[(p+i)%n]) return s[(p+i)%n] < s[(q+i)%n]; } return 0; } int main(){ int T; while(cin>>T){ while(T--){ char s[maxn]; cin>>s; int ans = 0; int len = strlen(s); for(int i = 1; i < len ; i++){ if(less1(s,i,ans)) ans = i; } for(int i = 0; i < len; i++){ cout<<s[(ans+i)%len]; } cout<<endl; } } }
相关文章推荐
- uva 10878 Decode the tape(字符串处理)
- uva 10815 Andy's First Dictionary(字符串处理+sort排序)
- UVa 455 Periodic Strings (字符串处理)
- [ACM_模拟] UVA 12504 Updating a Dictionary [字符串处理 字典增加、减少、改变问题]
- uva:310 - L--system(字符串处理+ bfs)
- uva 401 Palindromes(字符串处理)
- Immediate Decodability - UVa 644 字符串处理
- UVa 494 Kindergarten Counting Game (字符串处理)
- UVa 10340 All in All (字符串处理&编程技巧)
- Automatic Poetry - UVa 10361 简单字符串处理
- uva 644 Immediate Decodability(字符串处理)
- uva 502 DEL command(字符串处理)
- uva 185 Roman Numerals (深搜+字符串处理)
- uva 11988 Broken Keyboard(字符串处理+ STL)
- uva 401 Palindromes(基本的字符串处理)
- UVA 156 Ananagrams 模拟+字符串处理
- uva 409 Excuses, Excuses!(字符串处理)
- uva 310 L--system(隐式图搜索+字符串处理)
- (字符串的处理4.7.14)UVA 10252 Common Permutation(寻找两个字符串中的共同字符&&按字典序输出)
- Artificial Intelligence? - UVa 537 字符串处理