JOI 2014 - Secret

Author: Andi Qu

Table of Contents


Edit on Github
1#include "secret.h"
2
3int prefix[1000][1000], n;
4
5void populate(int L, int R, int A[]) {
6 int mid = (L + R) / 2;
7 prefix[mid][mid] = A[mid];
8 prefix[mid + 1][mid + 1] = A[mid + 1];
9
10 for (int i = mid + 2; i <= R; i++)

Give Us Feedback on JOI 2014 - Secret!

Join the Discussion!

Feel free to voice your thoughts in the comments section.