Submission #1535101

---

Source Code Expand

// This amazing code is by Eric Sunli Chen.
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
template<typename T> void get_int(T &x)
{
	char t=getchar();
	bool neg=false;
	x=0;
	for(; (t>'9'||t<'0')&&t!='-'; t=getchar());
	if(t=='-')neg=true,t=getchar();
	for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0';
	if(neg)x=-x;
}
template<typename T> void print_int(T x)
{
	if(x<0)putchar('-'),x=-x;
	short a[20]= {},sz=0;
	while(x>0)a[sz++]=x%10,x/=10;
	if(sz==0)putchar('0');
	for(int i=sz-1; i>=0; i--)putchar('0'+a[i]);
}
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define get1(a) get_int(a)
#define get2(a,b) get1(a),get1(b)
#define get3(a,b,c) get1(a),get2(b,c)
#define printendl(a) print_int(a),puts("")
typedef long long LL;
typedef unsigned long long uLL;
typedef pair<int,int> pii;
const int inf=0x3f3f3f3f;
const LL Linf=1ll<<61;
const double pi=acos(-1.0);

struct sparse_table
{
	int lg[100111],v[20][100111];
	void construct(int n,int *a)
	{
		for(int i=2;i<=n;i++)lg[i]=lg[i>>1]+1;
		for(int i=1;i<=n;i++)v[0][i]=a[i];
		for(int i=1;i<20;i++)for(int j=1;j<=n;j++)
		{
			int nxt=j+(1<<i-1);
			if(nxt>n)v[i][j]=v[i-1][j];
			else v[i][j]=max(v[i-1][j],v[i-1][nxt]);
		}
	}
	int query(int l,int r)
	{
		if(l>r)return 0;
		int len=lg[r-l+1];
		return max(v[len][l],v[len][r-(1<<len)+1]);
	}
}thor;

int n,m,a[233][5111];
LL sum[5111][5111],pre[5111];
void add(int*a)
{
	thor.construct(n,a);
	for(int i=1;i<=n;i++)
	{
		int l=0,r=i,mid,tl,tr;
		while(l<r-1)
		{
			mid=(l+r+1)>>1;
			if(thor.query(mid,i)==a[i])r=mid;
			else l=mid;
		}
		tl=r;
		l=i;r=n+1;
		while(l<r-1)
		{
			mid=(l+r)>>1;
			if(thor.query(i,mid)==a[i]&&thor.query(i+1,mid)!=a[i])l=mid;
			else r=mid;
		}
		tr=l;
		sum[tl][i]+=a[i];
		sum[i+1][tr+1]+=a[i];
		sum[tl][tr+1]-=a[i];
		sum[i+1][i]-=a[i];
	}
}
int main()
{
	get2(n,m);
	for(int i=2;i<=n;i++)
	{
		get1(pre[i]);
		pre[i]+=pre[i-1];
	}
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)get1(a[j][i]);
	for(int i=1;i<=m;i++)add(a[i]);
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)sum[i][j]+=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
	LL ans=0;
	for(int i=1;i<=n;i++)for(int j=i;j<=n;j++)
		ans=max(ans,sum[i][j]-pre[j]+pre[i]);
	printendl(ans);
	return 0;
}

Submission Info

Judge Result