A
Called mdzz
Obviously one can see it \ (f (x) <= 9 \ times 18 \) and then the front and rear blind 162 ** digital chaos sweep can do something out
I was playing table and engage in violent 1.5h +
Painful, result behind two questions on the GG
B
The water is still relatively a dp, but I was scared problems surface length of orzorzorz, that it is difficult not to engage in out out of C title, and finally turned around only to find good water (crying)
f [N] [M] [K] [0/1]: string of the current to the bit i s, t to the string of j-th bit, the current total
K substrings elected, the maximum length of s [i] to t [j] is selected if both of.
Consider s [i] to t [j], if we do not add them to the selected k sub-string, then:
dp[i][j][k][0] = max(dp[i][j][k][0], max(dp[i -1][j][k][0], dp[i-1][j][k][1]))
dp[i][j][k][0] = max(dp[i][j][k][0], max(dp[i][j 1][k][0], dp[i][j 1][k][1]))
If s [i] = t [j], and we add them to the selected sub-string of k, then:
dp[i][j][k][1] = max(dp[i][j][k][1], dp[i -1][j- 1][k][1] + 1)
dp[i][j][k][1] = max(dp[i][j][k][1], max(dp[i -1][j -1][k-1][0], dp[i -1][j 1][k-1][1]) + 1)
C
Too difficult, phd speak several times before they get to know, it has not been able to complete the code implementation
to sum up
Score desirable: \ (0 + 0 + 100 = 100 \)
Actual Score: \ (0 + 0 + 100 = 100 \)
B question should take full points, sigh 0