제출 #30852

#제출 시각아이디문제언어결과실행 시간메모리
30852Navick수열 (APIO14_sequence)C++14
0 / 100
6 ms3844 KiB
#include <bits/stdc++.h> #define F first #define S second #define pii pair<int, int> #define pb push_back using namespace std; typedef long long ll; typedef long double ld; const int N = 1e3 + 10, K = 210; ll dp[N][K], ps[N]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); int n, k; cin >> n >> k; ++k; for(int i=0; i<n; i++){ int x; cin >> x; ps[i + 1] = ps[i] + x; } for(int j=2; j<=k; j++) for(int i=1; i<=n; i++) for(int c=i-1; c>=0; c--) dp[i][j] = max(dp[i][j], (ps[i] - ps[c]) * ps[c] + dp[c][j - 1]); cout << dp[n][k] << endl; }
#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...