Submission #1169941

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1169941	2025-03-19 09:54:39	PieArmy	Split the sequence (APIO14_sequence)	C++20	0 / 100	0 ms	584 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
#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int n,k;
int arr[100023];
ll pref[100023],suf[100023];
deque<pair<int,ll>>q[200];
int opt[100023][200];
int main(){
  ios_base::sync_with_stdio(false);cin.tie(NULL);
  cin>>n>>k;
  for(int i=1;i<=n;i++){
    cin>>arr[i];
    pref[i]=arr[i]+pref[i-1];
  }
  for(int i=n;i>=1;i--){
    suf[i]=suf[i+1]+arr[i];
  }
  q[k-1].push_back({0,0});
  ll ans=-1;
  for(int i=1;i<n;i++){
    for(int j=0;j<k;j++){
      if(q[j].size()==0)continue;
      while(q[j].size()>1){
        if(q[j][0].second-suf[i+1]*pref[q[j][0].first]<=q[j][1].second-suf[i+1]*pref[q[j][1].first])q[j].pop_front();
        else break;
      }
      opt[i][j]=q[j][0].first;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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