hdu（HDU5945）單調隊列優化DP

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn = 1000000+10; int dp[maxn]; int q[maxn]; int main() { int cases,x,k,t; scanf("%d",&cases); while(

>>阅读原文<<