Submission #1185183

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
const ld eps=1e-9;
ll dp[64][64];
ll dp2[64][64];
int main(){
	int n,a,b;	cin>>n>>a>>b;
	vector<ll> v(n);
	for(int i=0;i<n;i++)	cin>>v[i];
	dp2[0][0]=1;
	for(int i=0;i<n;i++){
		for(int j=0;j<=i;j++){
			if(dp[i+1][j]<dp[i][j]){
				dp[i+1][j]=dp[i][j];
				dp2[i+1][j]=dp2[i][j];
			}
			else if(dp[i+1][j]==dp[i][j]){
				dp2[i+1][j]+=dp2[i][j];
			}
			if(dp[i+1][j+1]<dp[i][j]+v[i]){
				dp[i+1][j+1]=dp[i][j]+v[i];
				dp2[i+1][j+1]=dp2[i][j];
			}
			else if(dp[i+1][j+1]==dp[i][j]+v[i]){
				dp2[i+1][j+1]+=dp2[i][j];
			}
		}
	}
	ld ret=0;
	for(int i=a;i<=b;i++)	ret=max(ret,(ld)dp[n][i]/i);
	printf("%.15Lf\n",ret);
	ll pattern=0;
	for(int i=a;i<=b;i++){
		if(fabs(ret-(ld)dp[n][i]/i)<eps)	pattern+=dp2[n][i];
	}
	printf("%Ld\n",pattern);
	return 0;
}
			

Submission Info

Judge Result