C(clang11) 解法, 执行用时: 21ms, 内存消耗: 1016K, 提交时间: 2020-12-31 22:56:48

#include<stdio.h>
int max(int a,int b){
	if(a>b)return a;
	else{
		return b;
	}
}
int main(){
	int n,y;
	scanf("%d%d",&n,&y);
	int maxi,i,a[n],b[n];
	for(i=0;i<n;i++)scanf("%d",&a[i]);
	for(i=0;i<n;i++)scanf("%d",&b[i]);
	int z=0,x=0,c=0;
	for(i=0;i<n;i++){
		z+=a[i];
		x+=a[i]+b[i];
		c+=a[i]-b[i];
		maxi=max(maxi%y,max(z%y,max(x%y,c%y)))%y;
	}
	printf("%d",maxi);
}

JavaScript(V8 6.0.0) 解法, 执行用时: 78ms, 内存消耗: 19648K, 提交时间: 2021-01-01 00:41:49

let [n, mod] = readline().split(' ').map(i=>Number(i))

let a = readline().split(' ').map(i=>Number(i))
let b = readline().split(' ').map(i=>Number(i))

let sum = 0
for(let i=0;i<n;i++) {
    sum += a[i]
    sum%=mod
}
let max = sum
for(let i=0;i<n;i++) {
    sum +=b[i]
    sum %= mod
    max = Math.max(max,sum)
}


print(max)

C++(clang++11) 解法, 执行用时: 43ms, 内存消耗: 504K, 提交时间: 2021-01-01 10:10:14

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,y;
	cin>>n>>y;
	int i,j;
	int p,q;
	int num=0;
	
	for(i=0;i<n;i++){
		cin>>p;
		num+=p;
		num=num%y;
	}
	int max=num;
	
	for(i=0;i<n;i++){
		cin>>p;
		num+=p;
		num=num%y;
		if(num>max){
			max=num;
		}
	}
	
	printf("%d",max); 
	
	return 0;
}

Python3(3.9) 解法, 执行用时: 105ms, 内存消耗: 14464K, 提交时间: 2021-01-01 12:29:01

n,y = map(int,input().split())
la = list(map(int,input().split()))
lb = list(map(int,input().split()))
total = 0
for num in la:
    total += num
    total %= y
ans = total
for num in lb:
    total += num
    total %= y
    ans = max(ans,total)
print(ans)