2nd_Sem_Bogachev/2025.05.23/dist/Krivoruchenko_SK/solve_05.c
2025-05-19 20:33:04 +03:00

27 lines
372 B
C

#include "solve_05.h"
#include "node.h"
#include <string.h>
int t5_solve (node *head)
{
char *last = head->string;
int maximum = 1, count = 1;
for (head = head->next; head; head = head->next)
{
if (strcmp(head->string, last) > 0)
count++;
else {
if (maximum < count)
maximum = count;
count = 1;
}
last = head->string;
}
return maximum;
}