1#include <stdio.h>
2#include <stdlib.h>
3
4int max(int a, int b) {
5    return a > b ? a : b;
6}
7
8int maxPoints(int** points, int pointsSize, int* pointsColSize) {
9    int m = pointsSize;
10    int n = *pointsColSize; 
11    int* prevRow = (int*)malloc(sizeof(int) * n);
12
13    for (int j = 0; j < n; j++) {
14        prevRow[j] = points[0][j];
15    }
16
17    for (int i = 1; i < m; i++) {
18        int* leftToRight = (int*)malloc(sizeof(int) * n);
19        int* rightToLeft = (int*)malloc(sizeof(int) * n);
20        int* currentRow = (int*)malloc(sizeof(int) * n);
21
22        leftToRight[0] = prevRow[0];
23        for (int j = 1; j < n; j++) {
24            leftToRight[j] = max(leftToRight[j - 1] - 1, prevRow[j]);
25        }
26
27        rightToLeft[n - 1] = prevRow[n - 1];
28        for (int j = n - 2; j >= 0; j--) {
29            rightToLeft[j] = max(rightToLeft[j + 1] - 1, prevRow[j]);
30        }
31
32        for (int j = 0; j < n; j++) {
33            currentRow[j] = points[i][j] + max(leftToRight[j], rightToLeft[j]);
34        }
35
36        free(prevRow);
37        prevRow = currentRow;
38        free(leftToRight);
39        free(rightToLeft);
40    }
41
42    int maxPoints = 0;
43    for (int j = 0; j < n; j++) {
44        maxPoints = max(maxPoints, prevRow[j]);
45    }
46
47    free(prevRow);
48    return maxPoints;
49}
50
51int main() {
52    int points[][3] = {{1, 2, 3}, {1, 5, 1}, {3, 1, 1}};
53    int *columnSizes;
54    int pointsSize = 3;
55
56    columnSizes = (int *)malloc(pointsSize * sizeof(int));
57    for (int i = 0; i < pointsSize; i++) {
58        columnSizes[i] = 3;
59    }
60
61    int result = maxPoints((int **)points, pointsSize, columnSizes);
62    printf("Maximum points: %d\n", result);
63
64    free(columnSizes);
65    return 0;
66}

1
public class Solution {
    public static int MaxPoints(int[][] points) {
        int m = points.Length;
        int n = points[0].Length;

        int[] prevRow = new int[n];
        Array.Copy(points[0], prevRow, n);

        for (int i = 1; i < m; i++) {
            int[] leftMax = new int[n];
            int[] rightMax = new int[n];

            leftMax[0] = prevRow[0];
            for (int j = 1; j < n; j++) {
                leftMax[j] = Math.Max(leftMax[j - 1] - 1, prevRow[j]);
            }

            rightMax[n - 1] = prevRow[n - 1];
            for (int j = n - 2; j >= 0; j--) {
                rightMax[j] = Math.Max(rightMax[j + 1] - 1, prevRow[j]);
            }

            for (int j = 0; j < n; j++) {
                prevRow[j] = points[i][j] + Math.Max(leftMax[j], rightMax[j]);
            }
        }

        int maxPoints = 0;
        foreach (var val in prevRow) {
            if (val > maxPoints) maxPoints = val;
        }

        return maxPoints;
    }

    public static void Main() {
        int[][] points = new int[][] {
            new int[] {1, 2, 3},
            new int[] {1, 5, 1},
            new int[] {3, 1, 1}
        };
        Console.WriteLine("Maximum points: " + MaxPoints(points));
    }
}