没事干写了两个多小时的东西,已经跑过了。代码比较烂,做个参考吧。
#include <stdio.h>
#include <stdlib.h>
#include <stddef.h>
#include <stdarg.h>
#include <string.h>
#include <memory.h>
#include <errno.h>
#include <math.h>
typedef struct node {
int n;
struct node *link[2048];
int link_count;
} Node;
// direct: 1/-1 add to index; 0 follow link
// cur_flag: 1 for straight and -1 for reverse
// delete: -2~2 for index
int follow_link(Node *list, ptrdiff_t len, Node *check, Node *prev, Node *cur, int direct, int cur_flag, int delete)
{
int output = 0;
int i = 0;
if (direct == 0) {
for (i = 0; i < cur->link_count; ++i) {
if (cur->link[i] != prev) {
if (check == NULL || cur->link[i] - check == -1 * cur_flag) {
int ret = follow_link(list, len, cur, cur, cur->link[i], -cur_flag, -cur_flag, delete);
if (output < ret) {
output = ret;
}
} else if ((delete == 0 || ((delete == 1 || delete == -1) && delete * cur_flag < 0)) && cur->link[i] - check == -2 * cur_flag) {
int ret = follow_link(list, len, cur, cur, cur->link[i], -cur_flag, -cur_flag, delete + -cur_flag);
if (output < ret) {
output = ret;
}
} else if (delete == 0 && cur->link[i] - check == -3 * cur_flag) {
int ret = follow_link(list, len, cur, cur, cur->link[i], -cur_flag, -cur_flag, delete + -cur_flag * 2);
if (output < ret) {
output = ret;
}
}
}
}
return output + 1;
} else {
int ret = 0;
if (cur + direct - list >= 0 && cur + direct - list < len && (cur + direct -prev) * -direct > 0) {
output = follow_link(list, len, check, cur, cur + direct, 0, cur_flag, delete);
}
if (cur + direct * 2 - list >= 0 && cur + direct * 2 - list < len && (cur + direct * 2 - prev) * -direct > 0 && direct * delete >= 0 && direct * delete < 2) {
ret = follow_link(list, len, check, cur, cur + direct * 2, 0, cur_flag, delete + direct);
}
if (output < ret) {
output = ret;
}
if (cur + direct * 3 - list >= 0 && cur + direct * 3 - list < len && (cur + direct * 3 - prev) * -direct > 0 && delete == 0) {
ret = follow_link(list, len, check, cur, cur + direct * 3, 0, cur_flag, delete + direct * 2);
}
if (output < ret) {
output = ret;
}
return output + 1;
}
}
int
main(int argc, char *argv[])
{
char input[2048];
int i = 0, j = 0;
Node *list = malloc(sizeof(Node) * 2048);
while (fgets(input, 2048, stdin) == input) {
int max_len = 0;
int len = strlen(input);
input[len - 1] = '\0';
--len;
for (i = 0; i < len; ++i) {
if (input[i] < 'N') {
list[i].n = -(input[i] - 'A' + 1);
} else if (input[i] >= 'N') {
list[i].n = input[i] - 'M';
}
memset(list[i].link, 0, sizeof(list[i].link));
list[i].link_count = 0;
}
for (i = 0; i < len; ++i) {
for (j = i + 1; j < len; ++j) {
if (list[i].n + list[j].n == 0) {
list[i].link[list[i].link_count] = &list[j];
++list[i].link_count;
list[j].link[list[j].link_count] = &list[i];
++list[j].link_count;
}
}
}
for (i = 0; i < len; ++i) {
int ret = follow_link(list, len, NULL, NULL, &list[i], 0, 1, 0);
if (max_len < ret) {
max_len = ret;
}
}
printf("%d\n", max_len / 2);
}
free(list);
exit(0);
}