CSP202109第一题——数组推导

CSP202109第一题——数组推导

100分

#include <iostream>

using namespace std;

#define N 10000

int main(){
	int b[N];
	int n;
	int max, min;
	max = min = 0;
	cin >> n;
	for (int i=0; i<n; i++) {
		cin >> b[i];
		if (i == 0) {	//i=0
			max = b[i];
			min = b[i];
		}
		if (i > 0) {
			if (b[i] > b[i-1]) {
				max += b[i];
				min += b[i];
			}
			else if (b[i] == b[i-1]) {
				max += b[i];
				min += 0;	//修改点，从第二个开始，最小值必然是0
			}
		}
	}
	
	cout << max << endl;
	cout << min << endl;
	
	return 0;
} 

60分

#include <iostream>

using namespace std;

#define N 10000

int main(){
	int b[N];
	int n;
	int max, min;
	max = min = 0;
	cin >> n;
	for (int i=0; i<n; i++) {
		cin >> b[i];
		if (i == 0) {	//i=0
			max = b[i];
			min = b[i];
		}
		if (i > 0) {
			if (b[i] > b[i-1]) {
				max += b[i];
				min += b[i];
			}
			else if (b[i] == b[i-1]) {
				max += b[i];
				min += b[i];	//考虑不周
			}
		}
	}
	
	cout << max << endl;
	cout << min << endl;
	
	return 0;
}