ACM1024動態規劃

#include <cstdio> #include <algorithm> #define FI(a, b, c) for(int a = (b); a <= (c); a++) #define FD(a, b, c) for(int a = (b); a >= (c); a--) using namespace std; int n, m, t; long long d[1005], l

>>阅读原文<<