leetcode

0 class Solution {

1 public:

2 int maxSumDivThree(const vector<int> &nums) const {

3 int dp[3] = {0}, prev[3];

4

5 for (const int n : nums) {

6 memcpy(prev, dp, 3 * sizeof(int));

7 for (const int prev : span(prev, 3)) {

8 dp[(prev + n) % 3] = max(dp[(prev + n) % 3], prev + n);

9 }

10 }

11

12 return dp[0];

13 }

14 };