代码
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int n;
cin>>n;
int B[n+1];
int A[n+1];
int max_sum=0,min_sum=0;
for(int i=1;i<=n;i++)
{
cin>>B[i];
if(i==1)
{
A[i]=B[i];
max_sum+=A[i];
min_sum+=A[i];
}
else
{
if(B[i]>B[i-1])
{
A[i]=B[i];
max_sum+=A[i];
min_sum+=A[i];
}
else if(B[i]=B[i-1])
{
max_sum+=B[i];
}
}
}
cout<<max_sum<<endl;
cout<<min_sum;
return 0;
}