【打CF,学算法——二星级】CodeForces 520C DNA Alignment (构造)
来源:互联网 发布:jq循环二维数组 编辑:程序博客网 时间:2024/05/02 13:14
【CF简介】
提交链接:CF 520C
题面:
Vasya became interested in bioinformatics. He's going to write an article about similar cyclic DNA sequences, so he invented a new method for determining the similarity of cyclic sequences.
Let's assume that strings s and t have the same length n, then the functionh(s, t) is defined as the number of positions in which the respective symbols ofs and t arethe same. Functionh(s, t) can be used to define the function of Vasya distanceρ(s, t):
Vasya found a string s of length n on the Internet. Now he wants to count how many strings t there are such that the Vasya distance from the string s attains maximum possible value. Formally speaking, t must satisfy the equation: .
Vasya could not try all possible strings to find an answer, so he needs your help. As the answer may be very large, count the number of such strings modulo109 + 7.
The first line of the input contains a single integer n (1 ≤ n ≤ 105).
The second line of the input contains a single string of length n, consisting of characters "ACGT".
Print a single number — the answer modulo 109 + 7.
1C
1
2AG
4
3TTT
1
Please note that if for two distinct strings t1 andt2 valuesρ(s, t1) иρ(s, t2) are maximum among all possiblet, then both strings must be taken into account in the answer even if one of them can be obtained by a circular shift of another one.
In the first sample, there is ρ("C", "C") = 1, for the remaining stringst of length 1 the value ofρ(s, t) is 0.
In the second sample, ρ("AG", "AG") = ρ("AG", "GA") = ρ("AG", "AA") = ρ("AG", "GG") = 4.
In the third sample, ρ("TTT", "TTT") = 27
题意:
给定一个n长度的由ACGT四种序列构成的DNA序列。问有多少种方案,构造另一种序列,使得两种序列在shift过程中,两者相同的位数总和最大。
shift操作即移位操作,两者分别移动,然后求相同位的个数。
解题:
首先可以统计出ACGT每种序列的个数,题意是让我们构造一个ACGT序列,假如某一元素数量最大为k,明显是将所有的数量都分配给该元素,这样求得的值最大。但可能存在几种元素数量并列最多的情况。那么可以将所有的数量都随机分配给这几种元素(因为乘以相同的因子)。例如,有三种元素数量最多且一样,则方案数为3^n(n个位置可以随机分配三种元素中的一种)。
代码:
#include <iostream>#include <string>#include <cstdio>#include <algorithm>#define LL long long#define mod 1000000007using namespace std;int a[4];bool cmp(int a,int b){return a>b;}int main(){int n,factor;LL ans=1;string s;cin>>n>>s; for(int i=0;i<n;i++){if(s[i]=='A')a[0]++;else if(s[i]=='C')a[1]++;else if(s[i]=='G')a[2]++;elsea[3]++;}sort(a,a+4,cmp);if(a[0]!=a[1])ans=1;else{if(a[1]!=a[2]){ factor=2;}else{if(a[2]!=a[3])factor=3;else factor=4;}for(int i=0;i<n;i++)ans=ans*factor%mod;}cout<<ans<<endl;return 0;}
- 【打CF,学算法——二星级】CodeForces 520C DNA Alignment (构造)
- 【打CF,学算法——二星级】Codeforces 584C Marina and Vasya (简单构造)
- 【打CF,学算法——二星级】CodeForces 417C Football(构造)
- 【打CF,学算法——二星级】CodeForces 96B Lucky Numbers (构造/dfs)
- 【打CF,学算法——二星级】CodeForces 237B Young Table (构造)
- 【打CF,学算法——二星级】CodeForces 282C XOR and OR (观察)
- 【打CF,学算法——二星级】CodeForces 626C Block Towers(暴力/二分)
- 【打CF,学算法——二星级】CodeForces 689A Mike and Cellphone (模拟)
- 【打CF,学算法——二星级】CodeForces 417B Crash (水题)
- 【打CF,学算法——二星级】Codeforces 22B Bargaining Table(区域和)
- 【打CF,学算法——二星级】CodeForces 292A SMSC (模拟)
- 【打CF,学算法——二星级】Codeforces 699B - One Bomb (技巧)
- 【打CF,学算法——二星级】Codeforces 703B Mishka and trip (统计)
- 【打CF,学算法——二星级】Codeforces 705B Spider Man (简单博弈)
- 【打CF,学算法——二星级】CF 520B Two Buttons
- 【打CF,学算法——二星级】Codeforces Round #312 (Div. 2) A Lala Land and Apple Trees
- 【打CF,学算法——二星级】Codeforces Round #312 (Div. 2) B. Amr and The Large Array
- 【打CF,学算法——二星级】Codeforces Round #313 (Div. 2) B. Gerald is into Art(水题)
- Linux中yum和apt-get用法及区别
- 讯飞语音唤醒技术
- SQL Server 11_编写脚本和批处理
- i春秋安全勇士--一些简单题wp
- IOS学习之plist文件的操作
- 【打CF,学算法——二星级】CodeForces 520C DNA Alignment (构造)
- stroke和closePath
- STM32系列的浮点运算能力
- BP神经网络
- 洛谷 P2024 食物链
- 查询方式设计
- 用Intent 调用 打电话 发短信 播放音乐 删除软件 安装软件等操作
- web前端知识体系大全
- 【JAVA】List和map的简单示例代码