Submission #871006

#	Time	Username	Problem	Language	Result	Execution time	Memory
871006		Trisanu_Das	Seesaw (JOI22_seesaw)	C++17	34 / 100	62 ms	2640 KiB

seesaw

#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)1e3+10;
int n;
double a[mxN], pr[mxN], dp[mxN][mxN];
const double INF = 1e18;
 
double chk(double L){
	for(int i = 0; i <= n; i++){
		for(int j = 0; j <= n; j++){
			dp[i][j] = INF;
		}
	}
	for(int i = 0; i < n; i++)
		if(a[i]>=L) dp[i][i] = a[i];
	for(int l = 2; l <= n; l++){
		for(int i = 0; i+l-1 < n; i++){
			int j = i+l-1;
			if(pr[j+1]-pr[i] < L*(j-i+1)) continue;
			dp[i][j] = (pr[j+1]-pr[i])/(j-i+1);
			dp[i][j] = max(dp[i][j], min(dp[i+1][j],dp[i][j-1]));
		}
	}
	return dp[0][n-1];
}
 
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 i = 0; i < n; i++) pr[i+1] = pr[i]+a[i];
	for(int i = 0; i < n; i++){
		for(int j = i; j < n; j++){
			double L = (pr[j+1]-pr[i])/(j-i+1);
			ans = min(ans, chk(L)-L);
		}
	}
	cout << fixed << setprecision(9) << ans;
}

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