Codeforces Round #704 DIV2 C問題 (1500pt)
Problem description
省略
省略
C++に変換後のコードはこちら
//no-unlocked
int As, Bs;
char A[2d5+2], B[];
int dp1[], dp2[];
{
int res = 0;
rd(As, Bs, A, B);
dp1[0] = dp2[0] = -1;
rep(i,Bs){
dp1[i+1] = dp1[i] + 1;
while(B[i] != A[dp1[i+1]]) dp1[i+1]++;
}
reverse(A, A+As);
reverse(B, B+Bs);
rep(i,Bs){
dp2[i+1] = dp2[i] + 1;
while(B[i] != A[dp2[i+1]]) dp2[i+1]++;
}
rep(i,1,Bs) res >?= As - dp1[i] - dp2[Bs-i] - 1;
wt(res);
}
Current time: 2024年04月24日17時38分15秒
Last modified: 2021年02月24日08時17分42秒 (by laycrs)
Tags: Competitive_Programming_Incomplete Codeforces CF704 CF_DIV2_C
トップページに戻る
Logged in as: unknown user (not login)