度小满：商品贸易

 

 

这道题就是一道贪心，要找到最优情况，比如1,2,3,4,5,6,7,8,9.这时就可以直接选取1和9中间的值不会影响。所以就是不断找寻这种情况，来确定最优解；

代码如下：

#include<bits/stdc++.h>

using namespace std;
const int maxn = 1e5+10;
int n, a[maxn];

int main()
{
	scanf("%d", &n);
	for(int i = 0; i < n; i++)
		scanf("%d", &a[i]);
	int ans = 0, cnt = 0;
	int i = 0;
	while(i < n)
	{
		while(i < n-1 && a[i+1] <= a[i])
		{
			i += 1;
		}
		int minn = a[i];
		i+=1;
		//cout << "number1= " << xmin << " " << i << endl;
		while(i < n-1 && a[i+1] >= a[i])
		{
			i+=1;
		}
		//cout << "number2= " << xmin << " " << i << endl;
		if(i < n)
		{
			ans += a[i] - minn;
			cnt += 2;
		}
		//cout << ans << " " << cnt << endl;
	}
	cout << ans << " " << cnt << endl;
	return 0;
}