제출 #1087233

#제출 시각아이디문제언어결과실행 시간메모리
1087233Thunnus수열 (APIO14_sequence)C++17
0 / 100
2084 ms6232 KiB
#include<bits/stdc++.h> using namespace std; using i64 = long long; //#define int i64 #define vi vector<int> #define vvi vector<vi> #define vb vector<bool> #define pii pair<int, int> #define fi first #define se second #define sz(x) (int)(x).size() signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n, k; cin >> n >> k; vi a(n + 1); for(int i = 1; i <= n; i++){ cin >> a[i]; a[i] += a[i - 1]; } vvi dp(n + 1, vi(k + 1)); int ans = 0; for(int i = 1; i <= n; i++){ for(int j = 1; j <= k; j++){ for(int z = 1; z <= i; z++){ dp[i][j] = max(dp[i][j], dp[z - 1][j - 1] + (a[i] - a[z - 1]) * (a[n] - a[i])); } } ans = max(ans, dp[i][k]); } cout << ans << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...