제출 #750491

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
750491	2023-05-29 14:53:29	Sarpa	수열 (APIO14_sequence)	C++14	0 / 100	50 ms	84844 KiB

sequence

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// Be nam KHODA
#include<bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define int long long
typedef pair<int, int> pii;
const int N = 1e5 + 10, mx = 200 + 10, inf = 2e18;
int n, k;
int a[N], dp[N][2];
int32_t best[N][mx];
void solve(int k, int l = 0, int r = n - 1, int optl = 0, int optr = n - 1){
  int mid = (l + r) / 2;
  if(l > r) return;
  int ans = -1, sum = 0;
  dp[mid][k&1] = inf;
  for(int i = min(optr, mid); i >= max(1ll, optl); i--){
    sum += a[i];
    if(sum * sum + dp[i - 1][(k - 1)&1] <= dp[mid][k&1]){
      dp[mid][k&1] = sum * sum + dp[i - 1][(k - 1)&1];
      ans = i;
    }
  } 
  best[mid][k] = ans;
  solve(k, l, mid - 1, optl, ans);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 17
• Subtask 5: 0 / 21
• Subtask 6: 0 / 29