摘要：
HDU4283You Are the One区间dp，记忆话搜索运行时间：#include #include #include using namespace std;const int maxn = 105,inf = 1 e)return 0; if(dp[s][e][k] != inf)return dp[s][e][k]; for(int i = s; i #include #include using namespace std;const int maxn =105;const int inf = 1#include #define Max(a,b) (a)>(b)?(... 阅读全文
