AZEN-SGG/2nd_Sem_Bogachev
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Task 4 and 6-7 are wrong

Browse source
This commit is contained in:
AZEN-SGG 2025-05-20 22:06:06 +03:00
parent ed505ffc17
commit 1e17a5b2c2
3 changed files with 104 additions and 36 deletions
Download patch file Download diff file Expand all files Collapse all files

43
2025.05.23/03Ex/solve.c
View file

@ -5,29 +5,48 @@
int t3_solve (node *head) int t3_solve (node *head)
{ {
node *next = NULL; node *last, *next = NULL;
int count = 0, local = 0; int count = 0, local = 0;
if (!head)
return 0;
last = head;
head = last->next;
if (!head) if (!head)
return 0; return 0;
for (next = head->next; next; next = head->next) for (next = head->next; next; next = head->next)
{ {
int cmp = strcmp(next->string, head->string); int cmp_last = strcmp(head->string, last->string);
if (cmp < 0) { int cmp_next = strcmp(head->string, next->string);
if (local) {
count += local;
local = 0;
}
} else if (cmp == 0) {
if (local)
local++;
} else
local = 1;
if (cmp_last > 0) {
local = 1;
} else if (cmp_last == 0) {
if (local) {
if (cmp_next < 0) {
count += local;
local = 0;
} else
local++;
}
} else {
count += local;
local = 0;
}
last = head;
head = next; head = next;
} }
if (strcmp(last->string, head->string) >= 0)
count += local;
else
if (local >= 1)
count += local - 1;
return count; return count;
} }

54
2025.05.23/04Ex/solve.c
View file

@ -5,36 +5,66 @@
int t4_solve (node *head) int t4_solve (node *head)
{ {
int maximum = 0, count = 0, local = 0, strict = 0;
node *last, *next;
last = head;
head = last->next;
for (next = head->next; next; next = head->next)
{
int last_cmp = strcmp(head->string, last->string);
if (last_cmp == 0) {
local += (local > 0);
} else if (last_cmp < 0) {
if (strict) {
if (maximum < count)
maximum = count;
count = 0;
local = 1;
} else
local += (local > 0);
strict = 0;
} else {
count += local;
local = (local > 0);
strict = 1;
}
last = head;
head = next;
}
return maximum;
}
/*
char *last = head->string; char *last = head->string;
int maximum = 0, count = 0, local = 1, strict = 1; int maximum = 0, count = 0, local = 0, strict = 0;
for (head = head->next; head; head = head->next) for (head = head->next; head; head = head->next)
{ {
int cmp = strcmp(head->string, last); int cmp = strcmp(head->string, last);
if (cmp > 0) { if (cmp > 0) {
count += local; count += local;
if (maximum < count)
maximum = count;
count = 0;
local = 1; local = 1;
strict = 1; strict = 1;
} else if (cmp < 0) { } else if (cmp < 0) {
if (!strict) if (!strict)
count += local; count += local;
if (maximum < count)
maximum = count;
count = 0;
local = 1; local = 1;
strict = 0; strict = 0;
} else { } else {
local++; if (local)
local++;
} }
last = head->string; last = head->string;
} }
if (!strict)
count += local;
if (maximum < count)
maximum = count;
return maximum; return maximum;
} }
*/

43
2025.05.23/dist/Krivoruchenko_SK/solve_03.c vendored
View file

@ -5,29 +5,48 @@
int t3_solve (node *head) int t3_solve (node *head)
{ {
node *next = NULL; node *last, *next = NULL;
int count = 0, local = 0; int count = 0, local = 0;
if (!head)
return 0;
last = head;
head = last->next;
if (!head) if (!head)
return 0; return 0;
for (next = head->next; next; next = head->next) for (next = head->next; next; next = head->next)
{ {
int cmp = strcmp(next->string, head->string); int cmp_last = strcmp(head->string, last->string);
if (cmp < 0) { int cmp_next = strcmp(head->string, next->string);
if (local) {
count += local;
local = 0;
}
} else if (cmp == 0) {
if (local)
local++;
} else
local = 1;
if (cmp_last > 0) {
local = 1;
} else if (cmp_last == 0) {
if (local) {
if (cmp_next < 0) {
count += local;
local = 0;
} else
local++;
}
} else {
count += local;
local = 0;
}
last = head;
head = next; head = next;
} }
if (strcmp(last->string, head->string) >= 0)
count += local;
else
if (local >= 1)
count += local - 1;
return count; return count;
} }