oj.uz

Submission #231663

# Submission time Handle Problem Language Result Execution time Memory
231663 2020-05-14T09:59:44 Z filiptudose7 Mean (info1cup19_mean) C++11
100 / 100
 7 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
int n,i,j,k,dp[205][205];
int main()
{
    //freopen("in","r",stdin);
    //freopen("out","w",stdout);
    cin.sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    for(i=1;i<=n;++i)
    {
        int x;
        cin>>x;
        dp[i][i]=x;
    }
    for(i=n-1;i>=1;--i)
    {
        for(j=i+1;j<=n;++j)
        {
            for(k=i;k<j;++k)
            {
                dp[i][j]=max(dp[i][j],(dp[i][k]+dp[k+1][j])/2);
            }
        }
    }
    cout<<dp[1][n]<<'\n';
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Correct 7 ms 512 KB Output is correct
20 Correct 7 ms 512 KB Output is correct