POJ 3162 Walking Race——树形dp+尺取+线段树

RMQ蜜汁MLE？？多是写挫了，不过尺取+线段是nlogn就过了ios #include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; const int INF = 0x3f3f3f3f; const int maxn = 1e6 + 10; int n, m,

>>阅读原文<<