JiaHeng-DLUT
7/5/2020 - 6:25 PM

P16、三角形

int solve(vector<int> a, int n) {
	int ans = 0;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			for (int k = j + 1; k < n; k++) {
				if (a[i] + a[j] > a[k] && a[i] + a[k] > a[j] && a[j] + a[k] > a[i]) {
					ans = max(ans, a[i] + a[j] + a[k]);
				}
			}
		}
	}
	return ans;
}