Stone的博客

DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectan

FootballTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4963 Accepted: 2522DescriptionConsider a single-elimination football tournament involving 2n t

#include#include#include#include#include#include#include#include#includeusing namespace std;typedef long long ll;const int MAX = 1e3+10;const double eps = 1e-10;const double PI = acos(-1.

现在有一个旅客，对于他的1~i的行程都要求得在满足这个行程的前提下的最小话费dp_i 以i为结尾的行程的花费,然后可以枚举最后一张票怎么买去dp,后两种票是往前找的#include #include #include #include #include #include #include #include #include using namespace std;const

枚举特殊汤圆dp#include #include #include #include #include #include #include #include #include #include typedef long long LL;using namespace std;const int MAX = 1000+10;const double eps = 1e-

一开始对字符串处理一下，记录该串提供特定类别所需要的步骤然后dp，因为只有三种类别，用二进制来记录（0-7）#include #include #include #include #include #include #include #include #include using namespace std;const double PI = acos(-1.0);c

给定一个长度不超过60的n进制的数，字母用数字代替，求它在十进制情况下的最小值dp[i]表示取前i个数时获得的最小值注意不要爆INF#include #include #include #include typedef long long ll;using namespace std;const int MAX = 60+10;const ll INF = 1e18;c