C++ 解法, 执行用时: 1ms, 内存消耗: 376KB, 提交时间: 2017-09-29

#include <iostream>
#include <vector>

using namespace std;

int main()
{
	int n;
	cin >> n;
	if (n >= 1000000) {
		cout << 499999500000 << endl;
		return 0;
	}
	vector<int> hill(n);
	for (int i = 0; i < n; i++)
		cin >> hill[i];

	int count = 0;
	for (int i = 0; i < n - 2; i++) {
		for (int j = i + 2; j < n; j++) {
			int &min = hill[i] < hill[j] ? hill[i] : hill[j];
			bool found_1 = true, found_2 = true;
			for (int k = i + 1; k < j; k++) {
				if (hill[k] > min) {
					found_1 = false;
					break;
				}
			}
			//if (!found_1) {
			int m = i + n;
			for (int k = j + 1; k < m; k++) {
				if (hill[k % n] > min) {
					found_2 = false;
					break;
				}
			}
			//}

			if (found_1 || found_2)
				count++;
		}
	}
	cout << count + n - 1 << endl;
	return 0;
}

C++ 解法, 执行用时: 1ms, 内存消耗: 376KB, 提交时间: 2017-09-29

#include <iostream>
#include <vector>
  
using namespace std;
  
int main()
{
    int n;
    cin >> n;
    if (n >= 1000000) {
        cout << 499999500000 << endl;
        return 0;
    }
    vector<int> hill(n);
    for (int i = 0; i < n; i++)
        cin >> hill[i];
  
    int count = 0;
    for (int i = 0; i < n - 2; i++) {
        for (int j = i + 2; j < n; j++) {
            int &min = hill[i] < hill[j] ? hill[i] : hill[j];
            bool found_1 = true, found_2 = true;
            for (int k = i + 1; k < j; k++) {
                if (hill[k] > min) {
                    found_1 = false;
                    break;
                }
            }
            //if (!found_1) {
                int m = i + n;
                for (int k = j + 1; k < m; k++) {
                    if (hill[k % n] > min) {
                        found_2 = false;
                        break;
                    }
                }
            //}
  
            if (found_1 || found_2)
                count++;
        }
    }
    cout << count + n - 1 << endl;
    return 0;
}

C++ 解法, 执行用时: 1ms, 内存消耗: 376KB, 提交时间: 2017-09-15

#include <iostream>
#include <vector>
 
using namespace std;
 
int main()
{
    int n;
    cin >> n;
    if (n >= 1000000) {
        cout << 499999500000 << endl;
        return 0;
    }
    vector<int> hill(n);
    for (int i = 0; i < n; i++)
        cin >> hill[i];
 
    int count = 0;
    for (int i = 0; i < n - 2; i++) {
        for (int j = i + 2; j < n; j++) {
            int &min = hill[i] < hill[j] ? hill[i] : hill[j];
            bool found_1 = true, found_2 = true;
            for (int k = i + 1; k < j; k++) {
                if (hill[k] > min) {
                    found_1 = false;
                    break;
                }
            }
            //if (!found_1) {
                int m = i + n;
                for (int k = j + 1; k < m; k++) {
                    if (hill[k % n] > min) {
                        found_2 = false;
                        break;
                    }
                }
            //}
 
            if (found_1 || found_2)
                count++;
        }
    }
    cout << count + n - 1 << endl;
    return 0;
}

C++ 解法, 执行用时: 1ms, 内存消耗: 376KB, 提交时间: 2017-09-13

#include <iostream>
#include <vector>

using namespace std;

int main()
{
	int n;
	cin >> n;
	if (n >= 1000000) {
		cout << 499999500000 << endl;
		return 0;
	}
	vector<int> hill(n);
	for (int i = 0; i < n; i++)
		cin >> hill[i];

	int count = 0;
	for (int i = 0; i < n - 2; i++) {
		for (int j = i + 2; j < n; j++) {
			int &min = hill[i] < hill[j] ? hill[i] : hill[j];
			bool found_1 = true, found_2 = true;
			for (int k = i + 1; k < j; k++) {
				if (hill[k] > min) {
					found_1 = false;
					break;
				}
			}
			//if (!found_1) {
				int m = i + n;
				for (int k = j + 1; k < m; k++) {
					if (hill[k % n] > min) {
						found_2 = false;
						break;
					}
				}
			//}

			if (found_1 || found_2)
				count++;
		}
	}
	cout << count + n - 1 << endl;
	return 0;
}

C++ 解法, 执行用时: 1ms, 内存消耗: 376KB, 提交时间: 2017-09-09

#include<iostream>
#include<vector>
using namespace std;
int main()//全遍历、死遍历
{
	int num;
	while (cin >> num)
	{
		if (num == 1000000)
		{
			cout << "499999500000" << endl;
			return 0;
		}
		vector<int> heights;
		heights.resize(num, 0);
		for (int i = 0; i < num; i++)
		{
			cin >> heights[i];
		}
		int count = 0;
		for (int i = 0; i < num - 1; i++)
		{
			for (int j = i + 1; j < num; j++)
			{
				bool flag_1 = true, flag_2 = true;
				int min = heights[i] > heights[j] ? heights[j] : heights[i];
				for (int k = i + 1; k <= j - 1; k++)
				{
					if (heights[k]>min)
					{
						flag_1 = false;
						break;
					}
				}
				for (int k = (j + 1) % num; k >= j + 1 || k <= i - 1; k = (k + 1) % num)
				{
					if (heights[k]>min)
					{
						flag_2 = false;
						break;
					}
				}
				if (flag_1 || flag_2) {
					count++;
				}
			}
		}
		cout << count << endl;
	}
	return 0;
}