제출 #516518

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
516518		Theo830	Mean (info1cup19_mean)	C++17	100 / 100	10 ms	664 KiB

mean

#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 / 30
• Subtask 2: 70 / 70