ACM_序列
LzyRapX
Just For Fun .
展开
-
HDU 5783 Divide the Sequence(水题)
Divide the SequenceTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 218 Accepted Submission(s): 130Problem DescriptionAlice has a se原创 2016-08-02 20:25:30 · 1551 阅读 · 0 评论 -
#10 D. LCIS (dp+最长公共上升子序列)
题目链接:点击打开链接http://codeforces.com/contest/10/problem/D题意:求最长公共上升子序列。题解:假设dp[ i ]表示第二个串位置为 i 的时候与第一个串的的最长公共上升子序列是多少。枚举第一个串,再枚举第二个串。for(int i = 1; i{int pos=0;for(int j=1; j{原创 2017-04-28 21:03:31 · 575 阅读 · 0 评论 -
HDU 2065 "红色病毒"问题 ( 泰勒级数推导 )
"红色病毒"问题Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6023 Accepted Submission(s): 2539Problem Description医学界发现的新病毒因其蔓延速度和Interne原创 2016-10-01 17:12:18 · 763 阅读 · 0 评论 -
HDU 2062 Subset sequence (xjb搞)
Subset sequenceTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5057 Accepted Submission(s): 2432Problem DescriptionConsider the agg原创 2016-10-01 14:13:09 · 982 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2) C. Hard problem (dp)
C. Hard problemtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy is fond of solving different tasks.原创 2016-08-12 18:09:08 · 689 阅读 · 0 评论 -
最长公共子序列(LCS)
#include #include #include #include #include #include #include #include #include #include #include #include typedef long long LL; using namespace std; const int maxn=100;原创 2016-05-19 23:31:32 · 466 阅读 · 0 评论 -
HDU 5811 Colosseo (拓扑排序+LIS)
ColosseoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 530 Accepted Submission(s): 15Problem DescriptionMr. Chopsticks keeps N m原创 2016-08-11 19:05:54 · 781 阅读 · 0 评论 -
HDU 5748 BestCoder Round #84 Bellovin (LIS)(树状数组)
BellovinTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 540 Accepted Submission(s): 254Problem DescriptionPeter has a sequence原创 2016-07-24 18:39:50 · 1085 阅读 · 0 评论 -
HDU 5791 Two (DP)
TwoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 540 Accepted Submission(s): 242Problem DescriptionAlice gets two sequences A and原创 2016-08-02 22:46:30 · 743 阅读 · 0 评论 -
VK cup Div1 C. Vulnerable Kerbals (扩展gcd+DAG+最长路)
题目链接:点击打开链接http://codeforces.com/contest/800/problem/CC. Vulnerable Kerbals题意:给定n个0~m-1内的数和m,构造一个尽可能长的所有元素都在0~m-1内的数列,并且使所有前缀积模m不相同且不在n个数中出现过。题解:如果前 i 个数的前缀积为x,前i+1个数的前缀积可以为y当且仅当ax-b原创 2017-04-19 14:08:17 · 1222 阅读 · 0 评论