Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

hbhz_zcy's blog

By hbhz_zcy, history, 18 months ago, In English
$$$(f \ast g)(t)=\max\limits_{i=0}^t (f_i+g_{t-i})$$$

I thought for a long time and tried something like FFT to solve it but failed.
In fact,I haven't find a algorithm better than brute force,which is $$$O(n^2)$$$.

  • Vote: I like it
  • +14
  • Vote: I do not like it

| Write comment?