Submission #786490

#	Time	Username	Problem	Language	Result	Execution time	Memory
786490		Dan4Life	Seesaw (JOI22_seesaw)	C++17	1 / 100	203 ms	304 KiB

seesaw

#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)1e3+10;
int n;
double a[mxN];

int main()
{
	cin >> n;
	for(int i = 0; i < n; i++) cin >> a[i];
	sort(a,a+n); double ans = a[n-1]-a[0];
	for(int mask = 0; mask < (1<<n); mask++){
		double cur = accumulate(a,a+n,0.0)/n;
		double l = cur, r = cur;
		int L = 0, R = n-1;
		for(int i = 0; i < n-1; i++){
			if((mask>>i)&1) L++;
			else R--;
			cur = accumulate(a+L,a+R+1,0.0)/(R-L+1);
			l = min(l, cur), r = max(r, cur);
		}
		ans = min(ans, r-l);
	}
	cout << fixed << setprecision(9) << ans;
}

• Subtask 1: 1 / 1
• Subtask 2: 0 / 33
• Subtask 3: 0 / 33
• Subtask 4: 0 / 33