2014年2月23日
求最大公约数（优化）
摘要： #include <iostream> using namespace std; typedef long long ll; bool is_even(ll x) { if(x%2) return 0; else return 1; } ll gcd(ll x,ll y) { if(x<y) ret 阅读全文
posted @ 2014-02-23 10:04 ForeverEnjoy 阅读(244) 评论(0) 推荐(0)
poj 1050 To the Max(最大子矩阵之和，基础DP题)
摘要： To the MaxTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 38573Accepted: 20350DescriptionGiven 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 rectangle is the sum of a 阅读全文
posted @ 2014-02-23 00:00 ForeverEnjoy 阅读(697) 评论(0) 推荐(0)