Find the Best Sightseeing Pair

import java.util.Arrays;

public class MaxScoreSightseeingPair {
    public static int maxScoreSightseeingPair(int[] arr)
    {
        // This function finds the best sightseeing pair in
        // a city represented by an array values.
        //  - maxAfter: stores the maximum sightseeing score
        //  obtainable starting from city i+1

        int N = arr.length;
        int[] maxAfter = new int[N];

        // Initialize maxAfter for the last city (no city
        // after it).
        maxAfter[N - 1] = arr[N - 1] - (N - 1);

        // Fill maxAfter array in reverse order.
        for (int i = N - 2; i >= 0; i--) {
            maxAfter[i]
                = Math.max(maxAfter[i + 1], arr[i] - i);
        }

        int ans = 0;
        // Iterate through all cities except the last one.
        for (int i = 0; i < N - 1; i++) {
            // Calculate the total sightseeing score for the
            // current city and its best pairing city (i+1).
            ans = Math.max(ans,
                           arr[i] + i + maxAfter[i + 1]);
        }

        return ans;
    }

    public static void main(String[] args)
    {
        // Driver code to test the function
        int[] arr = { 8, 1, 5, 2, 6 };

        int maxScore = maxScoreSightseeingPair(arr);
        System.out.println("Max sightseeing score: "
                           + maxScore);
    }
}

// This code is contributed by Shivam