이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <deque>
#include <string>
#include <unordered_set>
#define Bekabot ios_base::sync_with_stdio(NULL);cin.tie(0);cout.tie(0);
#define fopen(s) freopen(s".in","r",stdin);freopen(s".out","w",stdout)
#define all(x) (x).begin(), (x).end()
#define len(x) (int)x.size()
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define elif else if
#define F first
#define S second
#define int long long
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(all(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(all(v),x)-v.begin())
const int N = 1e5 + 78 , inf = 1e18 , M = 1e9 + 7;
using namespace std;
string trans(int n , int k){
string s = "";
while(n != 0){
int d = n % k;
if(d < 10){
s = to_string(d) + s;
}
else{
s = char(d + 'A' - 10) + s;
}
n /= k;
}
return s;
}
int pref[N] , suff[N];
int dp[10000][220];
int p[1000][220];
void solve(){
int n , k;
cin >> n >> k;
int a[n + 1];
int x = 0;
for(int i = 1 ; i <= n ; i++){
cin >> a[i];
p[i][k] = i - 1;
}
for(int i = 1 ; i <= n ; i++)pref[i] = pref[i - 1] + a[i];
for(int i = n ; i >= 1 ; i--)suff[i] = suff[i + 1] + a[i];
for(int l = 1 ; l <= k ; l++){
for(int i = 1 ; i < n ; i++){
for(int j = 0 ; j < i ; j++){
if(dp[j][l - 1] + (pref[i] - pref[j]) * suff[i + 1] >= dp[i][l] + a[i]){
p[i][l] = j;
}
dp[i][l] = max(dp[i][l] , dp[j][l - 1] + (pref[i] - pref[j]) * suff[i + 1]);
}
}
}
int cur=-1;
int mx=-1;
for(int i = 1 ; i <= n ; i++){
if(dp[i][k] > mx){
mx=dp[i][k];
cur=i;
}
}
cout << mx << '\n';
for(int i=k;k>=1;k--){
cout<<cur<<' ';
cur=p[cur][k];
}
// v.pb(x);
//for(auto it : g[n - 1][k])cout << it << ' ';
}
signed main(){
Bekabot
int t = 1;
//cin >> t;
while(t--){
solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
sequence.cpp: In function 'void solve()':
sequence.cpp:79:10: warning: unused variable 'i' [-Wunused-variable]
79 | for(int i=k;k>=1;k--){
| ^
sequence.cpp:52:6: warning: unused variable 'x' [-Wunused-variable]
52 | int x = 0;
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |