题意：

给你一个数组aaa，你要将其分成四份，让这四份中和的最大值−-−最小值最小，输出这个最小值。
n≤2e5,ai≤1e9n\le2e5,a_i\le1e9n≤2e5,ai≤1e9

思路：

直接枚举不是很好做，考虑先枚举中间的位置iii，设被划分成的四段和分别是s1,s2,s3,s4s1,s2,s3,s4s1,s2,s3,s4且s1<s2,s3<s4s1<s2,s3<s4s1<s2,s3<s4，那么答案就是max(s2,s4)−min(s1,s3)max(s2,s4)-min(s1,s3)max(s2,s4)−min(s1,s3)。由此可知，我们要让abs(s2−s1)abs(s2-s1)abs(s2−s1)和abs(s4−s3)abs(s4-s3)abs(s4−s3)都尽可能小，用两个指针维护一下就好啦。

// Problem: D - Equal Cut
// Contest: AtCoder - AtCoder Regular Contest 100
// URL: https://atcoder.jp/contests/arc100/tasks/arc100_b
// Memory Limit: 1024 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#include<random>
#include<cassert>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid ((tr[u].l+tr[u].r)>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;const int N=1000010,mod=1e9+7,INF=0x3f3f3f3f;
const LL inf=0x3f3f3f3f3f3f3f3f;
const double eps=1e-6;int n;
int a[N];
LL pre[N];LL get(LL a,LL b,LL c,LL d) {return max(a,max(b,max(c,d)))-min(a,min(b,min(c,d)));
}int main()
{//  ios::sync_with_stdio(false);
//  cin.tie(0);cin>>n;for(int i=1;i<=n;i++) scanf("%d",&a[i]),pre[i]=pre[i-1]+a[i];LL ans=inf;for(int l=0,r=1,i=1;i<=n;i++) {while(l+1<=i&&abs(pre[l]-pre[i]+pre[l])>abs(pre[l+1]-pre[i]+pre[l+1])) l++;while(r+1<=n&&abs(pre[r]-pre[i]-pre[n]+pre[r])>abs(pre[r+1]-pre[i]-pre[n]+pre[r+1])) r++;ans=min(ans,get(pre[l],pre[i]-pre[l],pre[r]-pre[i],pre[n]-pre[r]));}printf("%lld\n",ans);return 0;
}
/**/

AtCoder Regular Contest 100 D - Equal Cut 思维 + 前缀和相关推荐

AtCoder Regular Contest 100 E - Or Plus Max Sos dp
传送门文章目录题意: 思路: 题意: 给你一个长度为2n2^n2n的数组,让你对于所有的1≤k≤2n−11\le k\le 2^n-11≤k≤2n−1求最大的ai+aj,0≤i<j≤2n−1 ...
AtCoder Regular Contest 065
AtCoder Regular Contest 065 C - Daydream Score : 300300300 points 倒着来就行了,正着来会产生歧义匹配,dreamer,dreamdre ...
AtCoder Regular Contest 061 E - Snuke‘s Subway Trip（建图 + dijkstra最短路 / 0/1bfs / 并查集）
AtCoder Regular Contest 061 E - Snuke's Subway Trip problem 洛谷翻译 my idea 最近一直在做网络流,所以一读这题后,我就想到了最小费用 ...
NOMURA Programming Contest 2021(AtCoder Regular Contest 121)
文章目录 A - 2nd Greatest Distance B - RGB Matching C - Odd Even Sort D - 1 or 2 E - Directed Tree F - L ...
AtCoder题解——AtCoder Regular Contest 107——B - Quadruple
题目相关题目链接 AtCoder Regular Contest 107 B 题,https://atcoder.jp/contests/arc107/tasks/arc107_b. Problem ...
AtCoder Grand Contest 008: Contiguous Repainting（思维)
Contiguous Repainting 时间限制: 2 Sec 内存限制: 256 MB 提交: 69 解决: 22 [提交][状态][讨论版][命题人:admin] 题目描述 There a ...
AtCoder Regular Contest 107 B - Quadruple（数学+思维）
题目链接:https://atcoder.jp/contests/arc107/tasks/arc107_b 给出两个数,n,k,现在有四个数,1<=a,b,c,d<=n ,要求满足等式 ...
AtCoder Regular Contest 071 D - 井井井 / ###
题目:http://arc071.contest.atcoder.jp/tasks/arc071_b 题意: 有一个二维的平面,给你xn根竖线和ym根横线,问这些线围成的长方形(正方形)的面积和(要求 ...
AtCoder Regular Contest 062 E - AtCoDeerくんと立方体づくり / Building Cubes with AtCoDeer
题目传送门:https://arc062.contest.atcoder.jp/tasks/arc062_c 题目大意: 给你\(N\)块正方形木板,每块木板四角有四种颜色(可以相同),木板中央有编号 ...

AtCoder Regular Contest 100 D - Equal Cut 思维 + 前缀和

文章目录

题意：

思路：

AtCoder Regular Contest 100 D - Equal Cut 思维 + 前缀和相关推荐

最新文章

热门文章