oj.uz

답안 #516518

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516518 2022-01-21T12:42:04 Z Theo830 Mean (info1cup19_mean) C++17
100 / 100
 10 ms 664 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
ll arr[205];
ll dp[205][205];
ll solve(ll i,ll j){
    if(i == j){
        return arr[i];
    }
    if(dp[i][j] != -1){
        return dp[i][j];
    }
    ll ans = 0;
    f(k,i,j){
        ans = max(ans,(solve(i,k) + solve(k+1,j)) / 2);
    }
    return dp[i][j] = ans;
}
int main(void){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    f(i,0,n){
        cin>>arr[i];
    }
    memset(dp,-1,sizeof dp);
    cout<<solve(0,n-1)<<"\n";
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 1 ms 580 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 0 ms 588 KB Output is correct
4 Correct 1 ms 580 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 592 KB Output is correct
7 Correct 1 ms 592 KB Output is correct
8 Correct 1 ms 592 KB Output is correct
9 Correct 0 ms 572 KB Output is correct
10 Correct 1 ms 592 KB Output is correct
11 Correct 0 ms 592 KB Output is correct
12 Correct 1 ms 592 KB Output is correct
13 Correct 2 ms 580 KB Output is correct
14 Correct 2 ms 592 KB Output is correct
15 Correct 3 ms 592 KB Output is correct
16 Correct 6 ms 656 KB Output is correct
17 Correct 9 ms 664 KB Output is correct
18 Correct 10 ms 660 KB Output is correct
19 Correct 9 ms 656 KB Output is correct
20 Correct 10 ms 592 KB Output is correct