Druning的博客

题目 D. Red-Green Towers time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are r red and g green block

题目 C. Relay Race time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Furik and Rubik take part in a relay race

题目 D. Match & Catch time limit per test 1 second memory limit per test 512 megabytes input standard input output standard output Police 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 Tree Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 42    Accepted Submission(s): 7 Problem Description Rec