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 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253
| #include <limits.h>
#include <stdio.h>
#include <stdlib.h>
/********************************* Structures ********************************/
typedef struct s_One_Value {
unsigned int max_pos;
unsigned int min_pos;
struct s_One_Value* next;
} t_One_Value;
typedef struct s_List_Sequences {
int max_value;
t_One_Value* list;
} t_List_Sequences;
/**************************** Forward Declarations ***************************/
void list_sequences_add_first_sequence(t_List_Sequences*, /*const*/ t_One_Value*, int /*max*/);
void list_sequences_add_sequence(t_List_Sequences*, /*const*/ t_One_Value*);
void list_sequences_delete(t_List_Sequences*);
void list_sequences_display(/*const*/ t_List_Sequences*, int* /*array*/);
unsigned char list_sequences_if_equal(/*const*/ t_List_Sequences*, int /*value*/);
unsigned char list_sequences_if_sup(/*const*/ t_List_Sequences*, int /*value*/);
void list_sequences_init(t_List_Sequences*);
void list_sequences_reset(t_List_Sequences*);
void one_value_copy(/*const*/ t_One_Value* /*from*/, t_One_Value* /*to*/);
void one_value_init(t_One_Value*, unsigned int /*min_pos*/, unsigned int /*max_pos*/);
/********************************* Inferface *********************************/
// XXX : should return an error if malloc failed
void list_sequences_add_first_sequence(t_List_Sequences* list, /*const*/ t_One_Value* one_value, int max) {
if (list != NULL) {
t_One_Value* new_value;
list_sequences_delete(list);
list->max_value = max;
new_value = malloc( sizeof(t_One_Value) );
if (new_value != NULL) {
one_value_copy(one_value, new_value);
new_value->next = NULL;
list->list = new_value;
} else {
list->list = NULL;
}
}
}
// XXX : should return an error if malloc failed
void list_sequences_add_sequence(t_List_Sequences* list, /*const*/ t_One_Value* one_value) {
if (list != NULL) {
t_One_Value* new_value;
new_value = malloc( sizeof(t_One_Value) );
if (new_value != NULL) {
one_value_copy(one_value, new_value);
new_value->next = list->list;
list->list = new_value;
}
}
}
void list_sequences_delete(t_List_Sequences* list) {
if ((list != NULL) && (list->list != NULL)) {
t_One_Value* sequence;
t_One_Value* next;
sequence = list->list;
while (sequence != NULL) {
next = sequence->next;
free(sequence);
sequence = next;
}
list->list = NULL;
}
}
// XXX Warning : no bounds checking
void list_sequences_display(/*const*/ t_List_Sequences* list, int* array) {
if ((list != NULL) && (array != NULL)) {
t_One_Value* value;
unsigned int index;
printf("Max value : %d\n\n", list->max_value);
value = list->list;
while (value != NULL) {
index = value->min_pos;
printf("Sequence : [%d, %d]\n%d", index, value->max_pos, array[index]);
for(++index; index <= value->max_pos; ++index) {
printf(" %d", array[index]);
}
printf("\n");
value = value->next;
}
}
}
unsigned char list_sequences_if_equal(/*const*/ t_List_Sequences* list, int value) {
unsigned char result;
if (list != NULL) {
result = (list->max_value == value);
} else {
result = 0;
}
return result;
}
unsigned char list_sequences_if_sup(/*const*/ t_List_Sequences* list, int value) {
unsigned char result;
if (list != NULL) {
result = (list->max_value < value);
} else {
result = 0;
}
return result;
}
void list_sequences_init(t_List_Sequences* list) {
if (list != NULL) {
list->max_value = INT_MIN;
list->list = NULL;
}
}
void list_sequences_reset(t_List_Sequences* list) {
if (list != NULL) {
list_sequences_delete(list);
list->max_value = INT_MIN;
}
}
void one_value_copy(/*const*/ t_One_Value* from, t_One_Value* to) {
if ((from != NULL) && (to != NULL)) {
to->max_pos = from->max_pos;
to->min_pos = from->min_pos;
// to->next = NULL;
}
}
void one_value_init(t_One_Value* value, unsigned int min_pos, unsigned int max_pos) {
if (value != NULL) {
value->max_pos = max_pos;
value->min_pos = min_pos;
value->next = NULL;
}
}
/************************************ Main ***********************************/
// XXX Warning : no bounds checking
void sum_values(int* array, unsigned int first_index, unsigned int length, int* sum) {
if ((array != NULL) && (sum != NULL)) {
unsigned int pos;
(*sum) = array[first_index];
for(pos=1; pos < length; ++pos) {
(*sum) += array[first_index + pos];
}
}
}
int main(int argc, char** argv)
{
t_List_Sequences list;
t_One_Value value;
int array[] = {2, -8, 3, -2, 4, -10, 5};
int tmp_sum ;
unsigned int index, nb_elements, length;
nb_elements = 6; // hardcode
list_sequences_init(&list);
for(length=1; length <= nb_elements; ++length) {
for(index=0; index <= (nb_elements - length); ++index) {
sum_values(array, index, length, &tmp_sum);
printf("sequence [%0u, %0u] with length %02d, sum = %d", index, (index + length - 1), length, tmp_sum);
if ( list_sequences_if_sup(&list, tmp_sum) ) {
printf(" -> new max value\n");
one_value_init(&value, index, (index + length - 1));
list_sequences_add_first_sequence(&list, &value, tmp_sum);
} else if ( list_sequences_if_equal(&list, tmp_sum) ) {
printf(" -> add this sequence\n");
one_value_init(&value, index, (index + length - 1));
list_sequences_add_sequence(&list, &value);
} else {
printf("\n");
}
}
}
printf("\n\nResult:\n");
list_sequences_display(&list, array);
list_sequences_delete(&list);
return 0;
} |
Partager