Tags

keep hungry keep foolish
费用流

AOJ2736-Longest Shortest Path

线性规划

AOJ2736-Longest Shortest Path

codeforces

Ozon Tech Challenge 2020

Div.1 + Div.2

Codeforces Round 625

Div. 1, based on Technocup 2020 Final Round

FFT

浅谈FFT与NTT

NTT

浅谈FFT与NTT

字符串周期

WPL与基本子串字典

基本子串字典

WPL与基本子串字典

总结

2020流水账