翻译:
有 个元素的序列 :
现在切三刀,将其切分为 个连续的非空子序列,这四个子序列中所有元素的和分别为 。
请求出 中,最大值与最小值的差,最小可能是多少?
很难,很难的一题(对于我这种蒟蒻来说)
50分代码
速度:
思路:
枚举断点,3层循环
代码
#pragma GCC optimize(1,"Ofast","inline")
#pragma GCC optimize(2,"Ofast","inline")
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[6007],n,sum[6007],maxo,mino,ans=0x3f3f3f3f;
int maxx(int a,int b,int c,int d){
return max(max(a,b),max(c,d));
}
int minn(int a,int b,int c,int d){
return min(min(a,b),min(c,d));
}
signed main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++)
scanf("%lld",a+i),sum[i]=sum[i-1]+a[i];
for(int i=1;i<n;i++)
for(int j=i+1;j<n;j++)
for(int k=j+1;k<n;k++){
maxo=maxx(sum[i],sum[j]-sum[i],sum[k]-sum[j],sum[n]-sum[k]);
mino=minn(sum[i],sum[j]-sum[i],sum[k]-sum[j],sum[n]-sum[k]);
ans=min(ans,maxo-mino);
}
printf("%lld",ans);
return 0;
}
可以优化么?可以
50分代码2
速度:
思路:
枚举中间断点,再用两个左右指针判断左右区间分别能到的最小差
代码:
#pragma GCC optimize(1,"Ofast","inline")
#pragma GCC optimize(2,"Ofast","inline")
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[200007],sum[200007],ans=0x3f3f3f3f3f3f;
int mxmn(int a,int b,int c,int d){return max(max(a,b),max(c,d))-min(min(a,b),min(c,d));}
int summxmn(int a,int b,int c){return mxmn(sum[a],sum[b]-sum[a],sum[c]-sum[b],sum[n]-sum[c]);}
int getsum(int a,int b){return sum[a]-sum[b];}
int bi(int c,int b,int a){return abs(getsum(b,c)-getsum(a,b));}
signed main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++)
scanf("%lld",a+i),sum[i]=a[i]+sum[i-1];
for(int i=2;i<n-1;i++){
int l=1,r=n-1;
while(r>i&&bi(i,r,n)>bi(i,r-1,n)) r--;
while(l<i&&bi(0,l,i)>bi(0,l+1,i)) l++;
ans=min(ans,summxmn(l,i,r));
}
printf("%lld",ans);
return 0;
}
肯定能再优化吧?能
100分代码
速度:
思路:
我们考虑到中间结点往右移的时候,和只有在原有的基础上往右移,才有可能比原方法更好的平分左、右区间
代码:
#pragma GCC optimize(1,"Ofast","inline")
#pragma GCC optimize(2,"Ofast","inline")
#pragma GCC optimize(3,"Ofast","inline")
#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
int a[200007],sum[200007],ans=0x3f3f3f3f3f3f;
int mxmn(int a,int b,int c,int d){return max(max(a,b),max(c,d))-min(min(a,b),min(c,d));}
int summxmn(int a,int b,int c){return mxmn(sum[a],sum[b]-sum[a],sum[c]-sum[b],sum[n]-sum[c]);}
int getsum(int a,int b){return sum[a]-sum[b];}
int bi(int c,int b,int a){return abs(getsum(b,c)-getsum(a,b));}
signed main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++)
scanf("%lld",a+i),sum[i]=a[i]+sum[i-1];
for(int i=2,l=0,r=1;i<n-1;i++){
while(r<n&&bi(i,r+1,n)<bi(i,r,n)) r++;
while(l<i&&bi(0,l,i)>bi(0,l+1,i)) l++;
ans=min(ans,summxmn(l,i,r));
}
printf("%lld",ans);
return 0;
}
祝大家!