...#296 (Div. 1) D - Fuzzy Search_51CTO博客_fftwf_plan_dft_1d
for(int i = 1; i <= n; i++) sum[i] += sum[i-1]; for(int i = 0; i < n; i++) { int mi = max(0, i - kk); int mx = min(n - 1, i + kk) + 1; if(sum[mx] - sum[mi]) a[i].r = 1.0; } for(int i = 0; i < m; i++) b[i].r = t[i] ==...