Druning的博客

题目D. Red-Green Towerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are r red and g green block

题目C. Relay Racetime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFurik and Rubik take part in a relay race

题目D. Match & Catchtime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputPolice headquarter is monitoring signal

题意给出a，b，c三个字符串，如果能把c拆成两个子序列，而且a，b分别等于这两个子序列，就输出Yes，否则输出No。解法动态规划，dp[i][j]为1表示a的前i个和b的前j个可以拼成c的前i+j个，0则表示不行，转移方程是if(dp[i][j]&&a[i+1]==c[i+j+1]) dp[i+1][j]=1;if(dp[i][j]&&b[j+1]==c[i+j+1]) dp[i][

题目Binary Indexed TreeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 42    Accepted Submission(s): 7Problem DescriptionRec