十来分钟AC……。CSP第一题果然是名不虚传的简单
个人觉得前缀和还是挺受CSP第一道题青睐的(从近几次的考试来看)
以下是本人题解:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 100001;
int n, Amax[maxn] = { 0 }, Amin[maxn] = { 0 }, B[maxn];
int main() {
cin >> n;
cin >> B[0]; Amax[0] = Amin[0] = B[0];
for (int i = 1; i < n; i++) {
cin >> B[i];
Amax[i] = Amax[i - 1] + B[i];
if (B[i] > B[i - 1]) Amin[i] = Amin[i - 1] + B[i];
else Amin[i] = Amin[i - 1] + 0;
}
cout << Amax[n - 1] << "\n" << Amin[n - 1];
return 0;
}