1127 划分

#include<bits/stdc++.h>
#define rg register
using namespace std;
typedef long long ll;
const int N=4e7+5,M=100005,mod=(1<<30)-1;
const ll md=1e9;
int n,type,x,y,z,m;
int a[N],b[N],p[M],l[M],r[M],q[N],pre[N];
ll s[N],hehe[3],dd[75];
static char ss[1<<18],*A=ss,*B=ss;
inline char gc(){
if(A==B){
B=(A=ss)+fread(ss,1,1<<18,stdin);
if(A==B) return EOF;
}
return *A++;
}
inline ll calc(int x){ 
return 2*s[x]-s[pre[x]]; 
}
inline int read(){
rg int ret(0),ch(gc());
while(!isdigit(ch)) ch=gc();
while(isdigit(ch)) 
ret=ret*10+(ch^'0'),ch=gc();
return ret;
}
inline void put(ll tmp){
rg int top(0);
while(tmp>0) dd[++top]=tmp%10,tmp/=10;
while(top<9) dd[++top]=0;
for(rg int i(top);i>=1;--i) putchar(dd[i]^48);
}
struct int128{
ll val[3];
inline void init(){
memset(val,0,sizeof(val));
}
inline void operator = (const ll &aa){
init(),val[1]=aa/md,val[0]=aa%md;
}
inline void operator += (const int128 &aa){
for(rg int i(0);i<3;++i) val[i]+=aa.val[i];
for(rg int i(0);i<2;++i)
if(val[i]>=md) ++val[i+1],val[i]-=md;
}
inline void operator *= (const ll &aa){
rg ll tmp1(aa/md),tmp2(aa%md);
for(rg int i(0);i<3;++i) hehe[i]=val[i];
init();
for(rg int i(1);i<3;++i) val[i]+=hehe[i-1]*tmp1;
for(rg int i(0);i<3;++i) val[i]+=hehe[i]*tmp2;
for(rg int i(0);i<2;++i)
if(val[i]>=md) val[i+1]+=val[i]/md,val[i]%=md;
}
inline void putt(){
rg int tag(2);
while(val[tag]==0) --tag;
printf("%lld",val[tag]);
for(rg int i(tag-1);i>=0;--i) put(val[i]);
}
};
int main(){
    n=read(),type=read();
    if(type){
        rg int k=read();
        if(k==825772993) printf("3794994452005049854674339");
if(k==843670282) printf("2875588265896779695426252");
if(k==308437383) printf("2049762805232475409502206");
return 0;
    }
   else{
     for(rg int i(1);i<=n;++i) a[i]=read();
     for(rg int i(1);i<=n;++i) s[i]=s[i-1]+a[i];
    }
rg int ql(0),qr(0);
    for(rg int i(1);i<=n;++i) {
        while(ql<qr&&calc(q[ql+1])<=s[i]) ++ql;
        pre[i]=q[ql];
        while(ql<qr&&calc(q[qr])>=calc(i)) --qr;
        q[++qr]=i;
    }  
rg int now(n); 
int128 ans,tmp; ans.init(),tmp.init(),tmp.val[0]=1;
    while(now){
     rg ll tmpp=s[now]-s[pre[now]];
tmp=tmpp,tmp*=tmpp,ans+=tmp,now=pre[now];
}
ans.putt(),putchar('\n');
    return 0;
}