Circular Sequence

最新推荐文章于 2019-04-17 18:17:47 发布
最新推荐文章于 2019-04-17 18:17:47 发布
阅读量244 收藏
点赞数
分类专栏： 模拟
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/Techay/article/details/47005831
版权

Description
Download as PDF
Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequence CGAGTCAGCT", that is, the last symbolT” in CGAGTCAGCT" is connected to the first symbolC”. 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<cstdio>
#include<cstring>
#include<iostream>
#include<string>
#include<string.h>
#include<queue>
#include<algorithm>
using namespace std;
char a[105];
int main()
{
    int i, j, m, n, ans, t, len;
    string temp1, temp2, temp3;
    cin >> t;
    while (t--)
    {
        cin >> temp1;
        temp3 = temp1;
        len = temp1.size();
        for (i = 0; i < len; i++)
        {
            temp2 = "";
            for (j = i; j < len; j++)
                temp2 += temp1[j];
            for (j = 0; j < i; j++)
                temp2 += temp1[j];
            if (temp2 < temp3)
                temp3 = temp2;
        }
        cout << temp3 << endl;
    }
    return 0;
}
Techay
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
UVa 1584 - Circular Sequence
Accepted丶
08-16 828
https://uva.onlinejudge.org/external/15/1584.pdfSome DNA sequences exist in circular forms as in the following figure, which shows a circular sequence CGAGTCAGCT", that is, the last symbol“T” in CGAGT
Fast Circular Cross Covariance：两个信号的Fast Circular Cross Covariance-matlab开发
06-01
%% %[lags,cc]=CXCOV(a,b) 返回长度为 M-1 的圆形交叉协方差%sequence cc 具有相应的滞后。 %% % 圆形互协方差是归一化的圆形互相关函数% 去除均值的两个向量： % c(k) = sum[a(n)-mean(a))*conj(b(n+k)-mean(b))]/...
UVa1584 - Circular Sequence
多看多听多总结
06-24 1129
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 ``
UVA - 1584 Circular Sequence
Epsilon
10-02 508
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
Dsp.zip_Fourier sequence_idft
09-21
bi-linear Filter. Circular Convolution of two sequences using DFT and IDFT. Discrete Fourier Transform (DFT) of the sequence
matlab开发-cicular序列和绘图的转换ngui.zip.zip
10-05
在MATLAB中， circular sequence（环状序列）是一种特殊的序列类型，它在处理循环移位、傅里叶变换以及通信系统中的调制解调等问题时非常有用。本项目重点探讨了如何在MATLAB环境中创建、操作环状序列，并将这些序列...
matlab开发-cicular序列和绘图的转换ngui
08-24
在MATLAB开发中，"circular sequence"（循环序列）和"plotting conversion"（绘图转换）是两个重要的概念，特别是在信号处理和数据分析领域。循环序列是指在进行数学运算时，序列在达到其终点后会再次从起点开始，...
CCS-model-for-ONT:一种新颖的流水线，可从一个分子读数中获得高精度序列
05-12
Similar to the CCS(the Circular Consensus Sequence) model of PacBio It's including two step 1: Amplification : Here we descibed a novel technology: 'self-amplification' which is simple and quick. 2:...
UVA-1584 Circular Sequence
Yvetteweiss的博客
02-26 298
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
Circular Sequence（环状序列）
weixin_33728708的博客
08-02 251
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 ``...
F - Circular Sequence
lannister_awalys_pay的博客
04-17 192
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; for(int i=0;i<n;i++){ string s; cin>>s; string t=s; vector<string>list; for(int ...
Sicily 1888. Circular Sequence
Happy Idle Kid
10-01 1240
题目给一个整数序列，让你想象它们是首尾相连的一个圈，让你求一段，使得这段内的和最大。 Segment Sum 最大。 其实，这种Segment可以有2种情况——一种是，没有跨越头尾的；另一种是跨过头尾的。 前者，只需要用一个O（n）的经典dp就可以求出来。（思路就是，假如以上一位结尾的段和小于0，那么这一位就不必连续了，自己开个头算了。） 后者，转化成，求一个段
【Uva 1584】 Circular Sequence
FZU_zyt的专栏_(:з」∠)_
02-19 364
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
To have detailed study on Circular Doubly Linked list. Definition: Detailed study (explanation): Applications: Operations: Program implementation: Java/C/C++ source code to perform operation: Output-screenshot:
最新发布
06-05
Definition: A circular doubly linked list is a data structure that consists of a sequence of nodes, where each node contains a value, a reference to the next node, and a reference to the previous node in the sequence. The last node in the list points to the first node, creating a circular structure. Detailed study (explanation): A circular doubly linked list is similar to a doubly linked list, but with the added feature of being circular. This means that the last node in the list points back to the first node, creating a loop. This allows for more efficient traversal of the list in both directions, as well as easier implementation of certain algorithms. Applications: Circular doubly linked lists are useful in situations where a list needs to be traversed in both directions, such as in a music playlist where the user can skip forwards and backwards through songs. They can also be used in certain algorithms, such as the Josephus problem, where a group of people are arranged in a circle and every nth person is eliminated until only one person is left. Operations: Some common operations that can be performed on a circular doubly linked list include: 1. Insertion: Adding a new node to the list at a specific position. 2. Deletion: Removing a node from the list. 3. Traversal: Moving through the list in either direction, starting at a specific node. 4. Search: Finding a specific node in the list based on its value. Program implementation: A circular doubly linked list can be implemented using a Node class that contains the value, a reference to the next node, and a reference to the previous node. The list itself can be represented by a head node that points to the first node in the list. Java/C/C++ source code to perform operation: Here's some Java code that demonstrates how to perform various operations on a circular doubly linked list: ``` public class Node { int value; Node next; Node prev; public Node(int value) { this.value = value; this.next = null; this.prev = null; } } public class CircularDoublyLinkedList { Node head; public CircularDoublyLinkedList() { this.head = null; } public void insert(int value, int position) { Node newNode = new Node(value); if (head == null) { head = newNode; head.next = head; head.prev = head; } else { Node current = head; for (int i = 1; i < position; i++) { current = current.next; } newNode.next = current.next; newNode.prev = current; current.next.prev = newNode; current.next = newNode; } } public void delete(int value) { if (head == null) { return; } Node current = head; do { if (current.value == value) { current.prev.next = current.next; current.next.prev = current.prev; if (current == head) { head = current.next; } return; } current = current.next; } while (current != head); } public void traverseForward() { if (head == null) { return; } Node current = head; do { System.out.print(current.value + " "); current = current.next; } while (current != head); System.out.println(); } public void traverseBackward() { if (head == null) { return; } Node current = head.prev; do { System.out.print(current.value + " "); current = current.prev; } while (current != head.prev); System.out.println(); } public Node search(int value) { if (head == null) { return null; } Node current = head; do { if (current.value == value) { return current; } current = current.next; } while (current != head); return null; } } ``` Output-screenshot: Here's an example of how to use the above code to perform various operations on a circular doubly linked list: ``` CircularDoublyLinkedList list = new CircularDoublyLinkedList(); list.insert(1, 1); list.insert(2, 2); list.insert(3, 3); list.insert(4, 4); list.traverseForward(); // Output: 1 2 3 4 list.traverseBackward(); // Output: 4 3 2 1 list.delete(2); list.traverseForward(); // Output: 1 3 4 Node node = list.search(3); System.out.println(node.value); // Output: 3 ```

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值