Design a Python program to compute the maximum sum of any subpolygon within a given array of N points
N = 5
points = [[1, 2], [2, 8], [4, 6], [8, 0], [7, -1]]
def max_subpolygon_sum(N, points):
  maximum_sum = 0
  for i in range(N):
    for j in range(i+1, N):
      for k in range(j+1, N):
        for l in range(k+1, N):
          current_sum = points[i][0] + points[j][1] + points[k][0] + points[l][1]
          maximum_sum = max(maximum_sum, current_sum)
  return maximum_sum

max_sum = max_subpolygon_sum(N, points)
print(f'The maximum sum of any subpolygon within the given array of points is {max_sum}.')