제출 #1020358

#제출 시각아이디문제언어결과실행 시간메모리
1020358lamagrilMean (info1cup19_mean)C++14
100 / 100
2 ms608 KiB
#include <bits/stdc++.h> using namespace std; const int N=205; vector<int> v(N); int dp[N][N]; int main(){ cin.tie(NULL)->sync_with_stdio(false); int n; cin >> n; for(int i=1 ; i<=n ; i++) cin >> v[i]; for(int i=1 ; i<=n ; i++){ dp[i][i]=v[i]; } for(int sz=1 ; sz<n ; sz++){ for(int l=1,r=l+sz ; r<=n ; l++,r++){ for(int k=l ; k<=r ; k++){ dp[l][r]=max((dp[l][k]+dp[k+1][r])/2,dp[l][r]); } } } cout << dp[1][n] << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...