UVa 1584:Circular Sequence
2017-01-30 21:41
399 查看
字典序,水题。
#include <stdio.h> #include <string.h> #define MAXLEN 105 char seq[MAXLEN]; int lessThan(int p1, int p2, int len) { int i = 0; while(i < len) { if(seq[(p1+i)%len] != seq[(p2+i)%len]) return seq[(p1+i)%len] < seq[(p2+i)%len]; ++i; } return 0; } int main() { int T, i, len; scanf("%d", &T); while(T--) { scanf("%s", seq); len = strlen(seq); int ans = 0; for(i = 1; i < len; ++i) if(lessThan(i, ans, len)) ans = i; for(i = 0; i < len; ++i) putchar(seq[(ans+i)%len]); putchar('\n'); } return 0; }
相关文章推荐
- UVa1584 - Circular Sequence
- 环状序列(Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)
- UVa -1584 Circular Sequence 解题报告 - C语言
- 例题3-6 环状序列(CircularSequence, ACM/ICPC Seoul 2004, UVa1584)
- UVa 1584 Circular Sequence --- 水题
- 环装序列 (Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)
- UVa1584 环状序列 (Circular Sequence)
- 【紫书】例题3-6 环状序列(Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)
- 环状序列(Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)
- UVA 1584 Circular Sequence【串的最小循环表示】
- Circular Sequence,ACM/ICPC Seoul 2004,UVa 1584
- UVA1584-Circular Squence
- UVa 10534 - Wavio Sequence
- UVA 348 Optimal Array Multiplication Sequence(区间dp)
- UVa1584——Circular Sequence
- UVa 694 The Collatz Sequence (数论)
- Ducci Sequence UVA - 1594
- UVaLive 7363 A Rational Sequence (二叉树)
- UVA 348 - Optimal Array Multiplication Sequence
- 算典03_例题_06_Uva-1584