摘要：
you are supposed to find the largest continue sum, together with the first and the last numbers of the maximum subsequence. 方程：f[i]=max(f[i-1]+A[i], A 阅读全文
摘要：
A+B for Polynomials #include<bits/stdc++.h> using namespace std; const int N=2005; double A[N],B[N],C[N];//C为结果数组 //同指数，指数不变，系数相加，即C[i]+=A[i]+B[i] int 阅读全文