This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int nx=205;
ll n, dp[nx][nx];
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n;
for (int i=1; i<=n; i++) cin>>dp[i][i];
for (int j=1; j<=n; j++) for (int i=1; i+j<=n; i++) for (int k=i; k<i+j; k++) dp[i][i+j]=max(dp[i][i+j], (dp[i][k]+dp[k+1][i+j])/2);
cout<<dp[1][n];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |