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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
|
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<map>
#include<stack>
#include<cmath>
#include<set>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<assert.h>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define mid (x+y>>1)
#define sqr(x) ((x)*(x))
#define NM 200005
#define nm 400005
using namespace std;
const double pi=acos(-1);
const ll inf=2e14;
ll read(){
ll x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
return f*x;
}
int n,m,tmp[NM],_t,c[NM];
ll a[NM],ans,_x;
bool cmp(int x,int y){return a[x]<a[y];}
struct node{
int x,y;
node*l,*r;
int s;
node(int x,int y,node*l=0,node*r=0):x(x),y(y),l(l),r(r){}
void upd(){s=max(l->s,r->s);}
void mod(){
if(x==y){s=_t;return;}
if(_x<=mid)l->mod();else r->mod();upd();
}
int query(){
if(a[x]>=_x)return s;
if(a[mid]>=_x) return max(l->query(),r->s);
else return r->query();
}
void init(){
s=-n;if(x==y)return;
l->init();r->init();
}
void res(){
if(x==y)return;
l->res();r->res();
free(l);free(r);
}
}*root;
node*build(int x,int y){return x==y?new node(x,y):new node(x,y,build(x,mid),build(mid+1,y));}
bool check(ll t){
root->init();
_t=0;_x=c[0];root->mod();
inc(i,1,n){
_x=a[c[i]]-t;
if(_x>a[n])continue;
_t=root->query()+1;
_x=c[i];
root->mod();
}
return root->s>=m;
}
int main(){
int _=read();while(_--){
n=read();m=read();a[0]=tmp[0]=c[0]=0;
inc(i,1,n)a[i]=a[i-1]+read(),tmp[i]=i;
sort(tmp,tmp+1+n,cmp);
sort(a,a+1+n);
inc(i,0,n)c[tmp[i]]=i;
root=build(0,n);
for(ll x=-inf,y=inf;x<=y;)
if(check(mid))ans=mid,y=mid-1;else x=mid+1;
root->res();free(root);
printf("%lld\n",ans);
}
return 0;
}
|
