HDU - 1560 DNA sequence
给你最多8个长度不超过5的DNA系列，求一个包含所有系列的最短系列。迭代加深的经典题。（虽然自己第一次写）定一个长度搜下去，搜不出答案就加深大搜的限制，然后中间加一些玄学的减枝//Twenty#include<cstdio>#include<cstdlib>#include&...
HDU 1560 DNA sequence(IDA*)
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1560题目大意：给出n个字符串，让你找一个字符串使得这n个字符串都是它的子串，求最小长度。解题思路：迭代加深搜索，迭代加深搜索，就是限制DFS的深度deep，若搜不到答案，则加深深度，重新搜索，这样就防止...
[Leetcode] Permutation Sequence
The set [1,2,3,…,n] contains a total of n! unique permutations.By listing and labeling all of the permutations in order,We get the following sequence ...
Codeforces Round #250 (Div. 1) D. The Child and Sequence（线段树）
D. The Child and Sequencetime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAt the children's day, ...
Codeforces Round #384 (Div. 2)B. Chloe and the sequence 数学
B. Chloe and the sequence题目链接http://codeforces.com/contest/743/problem/B题面Chloe, the same as Vladik, is a competitive programmer. She didn't have any ...
Codeforces Round #384 (Div. 2) B. Chloe and the sequence（规律题）
传送门DescriptionChloe, the same as Vladik, is a competitive programmer. She didn't have any problems to get to the olympiad like Vladik, but she was con...
POJ-2081 Recaman's Sequence
Recaman’s Sequence Time Limit: 3000MS Memory Limit: 60000K Total Submissions: 22392 Accepted: 9614 DescriptionThe Recaman’s sequence is de...
Number Sequence
Number SequenceA number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to ca...
poj3709 K-Anonymous Sequence[贪心+斜率优化dp]
地址n个数，可进行把一个数减小的操作，代价为减小的值。现求使数列任意一个数都存在至少k-1个数和他相同，问操作的最小代价。可以先考虑最小的数，由于只能减，所以必须得至少k-1个数减为最小数，贪心策略：从小到大从最小数开始的后面至少k-1个数必须减为他自己这一块代价才最小。很好想，如果里面有一个不选，...
POJ3709 K-Anonymous Sequence 斜率优化DP
POJ3709题意很简单 给n个递增整数（n<=500000）和一种操作（选择任意个数 使他们减少整数值） 使得对于所有的整数 在数列中 有k个相等的数O（n^2）的DP方程很容易得出 如下dp[i]=min{dp[j]+S[i]-S[j]-aj*(i-j)}| 0<=j<=i-k...
POJ3709 K-Anonymous Sequence
题意Language:DefaultK-Anonymous SequenceTime Limit: 4000MSMemory Limit: 65536KTotal Submissions: 6618Accepted: 2210DescriptionThe explosively increasing...
[POJ1180&POJ3709]Batch Scheduling&K-Anonymous Sequence 斜率优化DP
POJ1180 Batch SchedulingDescriptionThere is a sequence of N jobs to be processed on one machine. The jobs are numbered from 1 to N, so that the sequen...
【poj3709】 K-Anonymous Sequence
http://poj.org/problem?id=3709 (题目链接)题意给出一个n个数的序列，要求将其中一些数改为另一个比它小的数，改动的花费为两数的绝对值，完成改动后使得整个序列中出现过的数出现的次数大于等于K。求最小花费。Solution将原序列从大到小排序以后，我们可以发现，每次把连续的...
POJ2478 Farey Sequence —— 欧拉函数
题目链接：https://vjudge.net/problem/POJ-2478Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17753 Accepted: 7112DescriptionThe Far...
poj 2478 Farey Sequence 欧拉函数前缀和
Farey SequenceTime Limit: 1000MS Memory Limit: 65536K DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible ra...
UVA12995 Farey Sequence [欧拉函数，欧拉筛]
洛谷传送门Farey Sequence（格式太难调，题面就不放了）分析：实际上求分数个数就是个幌子，观察可以得到，所求的就是$\sum^n_{i=2}\phi (i)$，所以直接欧拉筛+前缀和即可。Code：#include<cstdio>#include<cstring>#...
Poj 2478-Farey Sequence 欧拉函数,素数,线性筛
Farey SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14291 Accepted: 5647DescriptionThe Farey Sequence Fn for any integer n with n ...
poj 2478 Farey Sequence(欧拉函数是基于寻求筛法素数)
http://poj.org/problem?id=2478求欧拉函数的模板。初涉欧拉函数，先学一学它主要的性质。1.欧拉函数是求小于n且和n互质(包含1)的正整数的个数。记为φ(n)。2.欧拉定理：若a与n互质。那么有a^φ(n) ≡ 1(mod n),经经常使用于求幂的模。3.若p是一个质数,那...
hdu1787 GCD Again poj 2478 Farey Sequence 欧拉函数
hdu1787，直接求欧拉函数#include <iostream>#include <cstdio>using namespace std;int n;int phi(int n){int ans=n;for(int i=2; i*i<=n; i++)if(n%i==...
POJ 2778 DNA Sequence (AC自己主动机 + dp)
DNA Sequence题意：DNA的序列由ACTG四个字母组成，如今给定m个不可行的序列。问随机构成的长度为n的序列中。有多少种序列是可行的（仅仅要包括一个不可行序列便不可行）。个数非常大。对100000取模。思路：推荐一个博客，讲的很清楚。这样的题目。n非常大，首先想到的就是用矩阵来优化。那么怎...