Easy Problems
Simple Count Description For two \(1\)~\(n\), define \(a,b\), orz(a,b)=max(a_1, b_1)+\)... (+max(a_n, b_n)\). You need t...
Noip simulation 90 2021.11.5 (longest problem solution)
T1 palindrome
This classic \ (dp \) just can'...
ESP-IDF teaching WiFi of ESP32 -- TCP communication of LwIP
This article comes from the secondary column WiFi and Lwip protocol stack on ESP32 under the original column ESP32 teach...
The implementation principle of BPF TCP congestion algorithm
Address: https://www.ebpf.top/post/ebpf_struct_ops
...