JOI 2014 - Secret

Author: Andi Qu


#include "secret.h"
int prefix[1000][1000], n;
void populate(int L, int R, int A[]) {
int mid = (L + R) / 2;
prefix[mid][mid] = A[mid];
prefix[mid + 1][mid + 1] = A[mid + 1];
for (int i = mid + 2; i <= R; i++)

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!