Cod sursa(job #2675262)
| Utilizator | Data | 21 noiembrie 2020 11:45:23 | |
|---|---|---|---|
| Problema | Arbori indexati binar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <stack>
#include <algorithm>
#include <string>
#include <queue>
#include <vector>
#include <map>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out"); //maybe change log
int** preProcess(int* input, int n) {
int** sparse = new int[n][(int)log2(n) + 1];
return sparse;
}
int main() {
return 0;
}
