-
Notifications
You must be signed in to change notification settings - Fork 7
/
Program.cs
49 lines (48 loc) · 1.85 KB
/
Program.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
//创建两个数组sumsL和sumsM,记录从某个位置开始向前L和M个数字之和。
//创建两个数组maxSumL和maxSumM,记录在某个位置之后M和L个数字能分别组成的最大值。
//遍历sumsL,寻找当前位置和另一个数组中当前位置之后M个位置之后的数字能组成的最大值。
//遍历sumsM,做与之前同样的操作。
using System;
namespace MaximumSumOfTwoNonOverlapping
{
class Program
{
static void Main(string[] args)
{
int[] A = { 2, 1, 5, 6, 0, 9, 5, 0, 3, 8 };
int L = 4;
int M = 3;
Console.WriteLine(MaxSumTwoNoOverlap(A, L, M));
}
static int MaxSumTwoNoOverlap(int[] A, int L, int M)
{
int[] sumsL = new int[A.Length];
int[] sumsM = new int[A.Length];
for (int i = 0; i < L; i++)
sumsL[L - 1] += A[i];
for (int i = 0; i < M; i++)
sumsM[M - 1] += A[i];
for (int i = L; i < A.Length; i++)
sumsL[i] = sumsL[i - 1] + A[i] - A[i - L];
for (int i = M; i < A.Length; i++)
sumsM[i] = sumsM[i - 1] + A[i] - A[i - M];
int[] maxSumL = new int[A.Length];
int[] maxSumM = new int[A.Length];
int maxL = 0;
int maxM = 0;
for (int i = A.Length-1; i >= 0; i--)
{
maxL = Math.Max(maxL, sumsL[i]);
maxSumL[i] = maxL;
maxM = Math.Max(maxM, sumsM[i]);
maxSumM[i] = maxM;
}
int res = 0;
for (int i = 0; i < A.Length - M; i++)
res = Math.Max(res, sumsL[i] + maxSumM[i + M]);
for (int i = 0; i < A.Length - L; i++)
res = Math.Max(res, sumsM[i] + maxSumL[i + L]);
return res;
}
}
}