OJ题解
文章平均质量分 74
Dark_Flame_Master
这个作者很懒,什么都没留下…
展开
-
hdoj 1003 最大子序列 (考虑负数)On算法
1003题目 Problem Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence原创 2014-11-26 14:39:41 · 896 阅读 · 0 评论 -
最大子序列递归
#include /* run this program using the console pauser or add your own getch, system("pause") or input loop */ using namespace std; int makeSumMax(const int *,int,int); int main(int argc, char原创 2014-11-16 22:19:37 · 567 阅读 · 0 评论 -
51Nod 论学好数学是多么重要 (圆与三角形相交)
#include //#include //#define cin in typedef long long ll; using namespace std; struct point { int x; int y; }; ll getdistance(point s1,point s2) { return (s1.x-s2.x)*(s1.x原创 2015-02-03 18:40:12 · 539 阅读 · 0 评论 -
POJ 1241
Oil Deposits Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13665 Accepted Submission(s): 7853 Problem Description The GeoSurvC原创 2014-12-27 19:56:37 · 573 阅读 · 0 评论