acm过河问题

#include<iostream>
#include<algorithm>
using namespace std;
void guohe(int n,int s[])
{
	int sum = 0;
	int t1, t2;
	while (n)
		{
			if (n == 1)
			{
				cout << s[0]<<endl;
				break;
			}
			else if (n == 2)
			{
				cout << sum + s[1] << endl;
				break;
			}
			else if (n == 3)
			{
				cout << sum + s[0] + s[1] << endl;
				break;
			}
			else
			{
				t1 = s[1] + s[0] + s[n - 1] + s[1];
				t2 = s[n - 1] + s[0] + s[n - 2] + s[0];
				sum = sum + (t1 < t2 ? t1 : t2);
				n = n - 2;
			}

		}
}
int main()
{
	int n;
	int k;
	cin >> k;
	
	while (k--)
	{
		int s[200];
		cin >> n;
		for (int i = 0; i < n; i++)
		{
			cin >> s[i];
		}
		guohe(n, s);
	}
	
}