Submission #1182235


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10Lf\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;

void Main() {
  ll n,l,r;
  cin >> n >> l >> r;
  ll a[n];
  rep(i,n) R a[i];
  ll dp[n+1][n+1],dp2[n+1][n+1];
  rep(i,n+1)rep(j,n+1)dp[i][j]=-MAXL;
  mem(dp2);
  dp[0][0]=0;
  dp2[0][0]=1;
  rep(i,n) {
    rrep(j,n+1) {
      if(j<n) {
        if(dp[i+1][j+1]<dp[i][j]+a[i]) {
          dp[i+1][j+1]=dp[i][j]+a[i];
          dp2[i+1][j+1]=dp2[i][j];
        } else if(dp[i+1][j+1]==dp[i][j]+a[i]) dp2[i+1][j+1]+=dp2[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];
    }
  }
  long double M=-1;
  ll x=0;
  REP(i,l,r+1) M=max(M,(long double)dp[n][i]/i);
  REP(i,l,r+1) {
    if(M==(long double)dp[n][i]/i) x+=dp2[n][i];
  }
  pd(M);
  pr(x);
}

int main(){Main();return 0;}

Submission Info

Submission Time
Task D - Maximum Average Sets
User kzyKT
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1885 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 4
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sample_04.txt AC 1 ms 256 KB
subtask_1_1.txt AC 1 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB
subtask_1_12.txt AC 1 ms 256 KB
subtask_1_13.txt AC 1 ms 256 KB
subtask_1_14.txt AC 1 ms 256 KB
subtask_1_15.txt AC 1 ms 256 KB
subtask_1_2.txt AC 1 ms 256 KB
subtask_1_3.txt AC 1 ms 256 KB
subtask_1_4.txt AC 1 ms 256 KB
subtask_1_5.txt AC 1 ms 256 KB
subtask_1_6.txt AC 1 ms 256 KB
subtask_1_7.txt AC 1 ms 256 KB
subtask_1_8.txt AC 1 ms 256 KB
subtask_1_9.txt AC 1 ms 256 KB