用O(n^3)的复杂度qqqq

提交记录qqqq

代码qqqq

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, ans;
int a[200005];
signed main(){
	cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i];
	for(int i = 0; i < n; i++)
		for(int j = 0; j < n; j++)
			for(int k = 0; k < n; k++)
				if(i != j && j != k)
					ans = max(ans, (a[i] + a[j]) % a[k]);	
	cout << ans;
	return 0;
}