POJ1088(动态规划+搜索)

 题目连接:https://vjudge.net/contest/49759#problem/Eios //#include<bits/stdc++.h> #include<cstdio> #include<cstring> #include<iostream> using namespace std; const int maxn = 1e2+10; const int inf = 0x3f3
相关文章
相关标签/搜索