-
Notifications
You must be signed in to change notification settings - Fork 0
/
prueba.cpp
101 lines (63 loc) · 1.57 KB
/
prueba.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include <math.h>
#include <iostream>
#include <vector>
#include "functions.h"
int defct(int x, int y, int n, Nodo nodo){
int techo = ceil((n+1)/2.);
int N_total = 0;
int N_aux = 0;
vector< vector <int> > aux = nodo.perfil;
for (unsigned i = 0; i < nodo.perfil.size(); i++){
vector <int> z = aux.back();
aux.pop_back();
N_aux = N(x,y,z);
N_total =+ N_aux;
}
return max(0,techo - N_total);
}
int N(int x,int y,vector<int> v){
int posx, posy;
for (int i=0;i<v.size();i++){
if (v[i] == x)
posx = i;
else if (v[i] == y)
posy = i;
}
if (posx < posy)
return 1;
else
return 0;
}
int T(int x, vector <int> cand,int n, Nodo nodo){
int suma = 0;
int aux = 0;
for (unsigned i = 0; i < cand.size(); i++){
if (cand[i] != x){
aux = defct(x,cand[i],n,nodo);
suma = suma + aux;
}
}
}
int T_prima(int x, vector<int> cand, int n, Nodo nodo, int m){
int t = T(x,cand,n,nodo);
return (t + log2(m)+ 1) /log2(m) + 3;
}
int main () {
int n = 10;
int x = 1;
int y = 8;
//vector<vector <int> > m;
/*Nodo nodo2;
vector <int> d, e, f,g,i;
d.push_back(1); d.push_back(0); d.push_back(8);
e.push_back(0); e.push_back(1); e.push_back(8);
g.push_back(4); g.push_back(2); g.push_back(1);
f.push_back(5); f.push_back(1); f.push_back(2);
i.push_back(1); i.push_back(2); i.push_back(4);*/
//nodo2.insertar(e);
// nodo.insertar(d);
//nodo.insertar(g);
// nodo.mostrar();
// cout << "defct " << defct(x,y,n,nodo2) << endl;*/
return 0;
}