Submission #152096

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
152096	2019-09-06T11:19:29 Z	nicolaalexandra	popa (BOI18_popa)	C++14	Compilation error	0 ms	0 KB

popa

#include <iostream>
//#include "popa.h"
#define DIM 1010
using namespace std;
int Left[DIM],Right[DIM],t[DIM];
int solve (int n, int *Left, int *Right){

    for (int i=0;i<n;i++)
        Left[i] = Right[i] = t[i] = -1;
    /// pt ca parcurgerea in inordine e 0..n-1, arborele are structura unui arbore binar de cautare
    /// si tot subarborele lui i contine o subsecv compacta de nr
    /// val[Left[nod]] = val[nod]-1 => pe i incerc sa l pun fix desupra lui i-1
    int rad = 0;
    for (int i=1;i<n;i++){
        int x = i-1;
        while (x >= 0 && !query(x,x,x,i)) /// cat timp x nu e radacina subarborelui
            x = t[x];

        if (x >= 0){
            /// il adaug pe i intre nodurile x si Right[x] (pt ca Left[x] e deja fixat)
            Left[i] = Right[x]; /// subarborele il plasez in stanga pt ca toate nodurile sunt mai mici decat i
            Right[x] = i;
            if (Left[i] >= 0) /// poate sa fie si -1
                t[Left[i]] = i;
            t[i] = x;

        } else { /// inseamna ca i va fi noua radacina
            Left[i] = rad;
            t[rad] = i;
            rad = i;
        }}
    return rad;
}

Compilation message

popa.cpp: In function 'int solve(int, int*, int*)':
popa.cpp:16:27: error: 'query' was not declared in this scope
         while (x >= 0 && !query(x,x,x,i)) /// cat timp x nu e radacina subarborelui
                           ^~~~~