description
analysis
-
首先有一個結論,對於區間劃分最後一段的和儘量小,答案會更優,具體證明參考毛爺爺的博客
-
設爲滿足劃分最優時、這段和最小時的最右的端點,最優劃分即爲從開始向不斷統計
-
由後一段比前一段大可知,即
-
右邊只和有關,把右邊的記爲,於是可以維護一個值上升的單調隊列來求出每一位的
-
具體維護就是,隊頭不斷出隊直到(因爲要儘可能大),賦爲隊頭
-
若隊尾再不斷出隊(因爲更小且更靠右),最後進隊,就完成了隊列的維護
code
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAXN 40000005
#define ha 1073741824
#define ll long long
#define LL __int128
#define reg register int
#define fo(i,a,b) for (reg i=a;i<=b;++i)
#define fd(i,a,b) for (reg i=a;i>=b;--i)
using namespace std;
int p[100005],l[100005],r[100005];
int f[MAXN],q[MAXN];
ll b[MAXN],sum[MAXN];
int n,type;
inline int read()
{
ll x=0,f=1;char ch=getchar();
while (ch<'0' || '9'<ch){if (ch=='-')f=-1;ch=getchar();}
while ('0'<=ch && ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
inline ll clac(ll x){return 2*sum[x]-sum[f[x]];}
inline void print(LL x)
{
int num[55];num[0]=0;
while (x)num[++num[0]]=x%10,x/=10;
while (num[0])printf("%d",num[num[0]--]);
printf("\n");
}
int main()
{
n=read(),type=read();
if (type)
{
int x=read(),y=read(),z=read();b[1]=read(),b[2]=read();int m=read(),now=1;
fo(i,1,m)p[i]=read(),l[i]=read(),r[i]=read();
fo(i,3,n)b[i]=(x*b[i-1]%ha+y*b[i-2]%ha+z)%ha;
fo(i,1,n)
{
if (i>p[now])++now;
sum[i]=sum[i-1]+(b[i]%(r[now]-l[now]+1))+l[now];
}
}
else {fo(i,1,n)sum[i]=sum[i-1]+read();}
int head=0,tail=0;
fo(i,1,n)
{
while (head<tail && sum[i]>=clac(q[head+1]))++head;
f[i]=q[head];
while (head<tail && clac(i)<=clac(q[tail]))--tail;
q[++tail]=i;
}
LL ans=0;
for (reg i=n;i;i=f[i])ans+=(LL)(sum[i]-sum[f[i]])*(sum[i]-sum[f[i]]);
print(ans);
return 0;
}