CCF CSP 202109-1数组推导

#include<iostream>
#include<cstdlib> 
using namespace std;
typedef long long ll;
int A[100+5];
int B[100+5];
int main(){
	int n;
	scanf("%d",&n);
	int summax = 0;
	for(int i=1;i<=n;i++){
		scanf("%d",&B[i]);
		summax += B[i];
	}
	int recent = A[1]= B[1];
	int summin = B[1];
	for(int i=2;i<=n;i++){
		if(B[i]==recent){
			summin += 0;
		}else{
			summin +=B[i];
		}
		recent = B[i];
	}
	cout<<summax<<endl<<summin<<endl;
	return 0;
}

或者：

#include<iostream>
#include<algorithm>
using namespace std;

int main() {
	int n;
	int Bi,Bi_1;
	int summin,summax ;
	cin>>n;
	cin>>Bi;
	summin = summax = Bi;
	Bi_1 = Bi;
	for(int i=1;i<n;i++){
		cin>>Bi;
		if(Bi>Bi_1){
			summin += Bi;
			summax += Bi;
		}
		if(Bi==Bi_1){
			summax += Bi;
		}
		Bi_1 = Bi;
	} 
	cout<<summax<<endl<<summin;
	return 0;
}