1007 Maximum Subsequence Sum (25 point(s))

題解 水題。 #include<iostream> #include<cstdio> using namespace std; const int INF = 0x3f3f3f3f; int first, last, sum, temp, cnt; int n, l, a[10000]; int main() { scanf("%d", &n); for(int i = 0; i < n; +
相關文章
相關標籤/搜索