Problem:
Score : 600 points

Problem Statement

Given is an integer sequence A_1, ..., A_N of length N.

We will choose exactly \left\lfloor \frac{N}{2} \right\rfloor elements from this sequence so that no two adjacent elements are chosen.

Find the maximum possible sum of the chosen elements.

Here \lfloor x \rfloor denotes the greatest integer not greater than x.

Constraints

2 \leq N \leq 2\times 10^5

|A_i|\leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 ... A_N

Output

Print the maximum possible sum of the chosen elements.

Sample Input 1

6
1 2 3 4 5 6

Sample Output 1

12

Choosing 2, 4, and 6 makes the sum 12, which is the maximum possible value.

Sample Input 2

5
-1000 -100 -10 0 10

Sample Output 2

0

Choosing -10 and 10 makes the sum 0, which is the maximum possible value.

Sample Input 3

10
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000

Sample Output 3

5000000000

Watch out for overflow.

Sample Input 4

27
18 -28 18 28 -45 90 -45 23 -53 60 28 -74 -71 35 -26 -62 49 -77 57 24 -70 -93 69 -99 59 57 -49

Sample Output 4

295

Solution in Java (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author KharYusuf
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        FSelectHalf solver = new FSelectHalf();
        solver.solve(1, in, out);
        out.close();
    }

    static class FSelectHalf {
        public void solve(int testNumber, FastReader s, PrintWriter w) {
            int n = s.nextInt();
            int[] a = new int[n + 1];
            for (int i = 1; i <= n; i++) a[i] = s.nextInt();
            if ((n & 1) == 1) {
                long[][] dp = new long[n + 1][3];
                dp[1][0] = a[1];
                dp[1][1] = a[1];
                dp[2][0] = -(long) 2e14;
                dp[2][1] = a[2];
                dp[3][0] = a[1] + a[3];
                dp[3][1] = a[3];
                dp[3][2] = a[3];
                for (int i = 4; i <= n; i++) {
                    dp[i][0] = dp[i - 2][0] + a[i];
                    dp[i][1] = Math.max(dp[i - 3][0] + a[i], dp[i - 2][1] + a[i]);
                    dp[i][2] = func.max(dp[i - 4][0] + a[i], dp[i - 3][1] + a[i], dp[i - 2][2] + a[i]);
                }
                w.println(func.max(dp[n][2], dp[n - 1][1], dp[n - 2][0]));
            } else {
                long[][] dp = new long[n + 1][2];
                dp[1][0] = a[1];
                dp[1][1] = a[1];
                dp[2][0] = -(long) 2e14;
                dp[2][1] = a[2];
                for (int i = 3; i <= n; i++) {
                    dp[i][0] = dp[i - 2][0] + a[i];
                    dp[i][1] = Math.max(dp[i - 3][0] + a[i], dp[i - 2][1] + a[i]);
                }
                //for(int i=0;i<=n;i++) w.println(dp[i][0]+" "+dp[i][1]);
                w.println(func.max(dp[n][1], dp[n - 1][0]));
            }
        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private FastReader.SpaceCharFilter filter;

        public FastReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {

            if (numChars == -1)
                throw new InputMismatchException();

            if (curChar >= numChars) {

                curChar = 0;

                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }

                if (numChars <= 0)
                    return -1;
            }

            return buf[curChar++];
        }

        public int nextInt() {

            int c = read();

            while (isSpaceChar(c))
                c = read();

            int sgn = 1;

            if (c == '-') {
                sgn = -1;
                c = read();
            }

            int res = 0;

            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();

                res *= 10;
                res += c - '0';
                c = read();
            }
            while (!isSpaceChar(c));

            return res * sgn;
        }

        public boolean isSpaceChar(int c) {

            if (filter != null)
                return filter.isSpaceChar(c);

            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }

    static class func {
        public static long max(long... v) {
            long max = Integer.MIN_VALUE;
            for (long i : v) max = Math.max(max, i);
            return max;
        }

    }
}