解题代码
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
long long n, sumMax,sumMin;
int main() {
cin >> n;
vector<long long>arr(n);
for (size_t i = 0; i < n; i++)
{
cin >> arr[i];
}
for (auto& it : arr)
{
sumMax += it;
}
cout << sumMax << endl;
auto last = unique(arr.begin(), arr.end());
arr.erase(last, arr.end());
for (auto& it : arr)
{
sumMin += it;
}
cout << sumMin;
return 0;
}
187

被折叠的 条评论
为什么被折叠?



