一、相关介绍
后缀数组
- 处理字符串的有力工具
- 可以处理后缀自动机解决不了的问题
后缀数组被称为SA，后缀自动机被称为SAM 。
更详细的讲解点击
相关文章
- BZOJ4278 [ONTAK2015]Tasowanie[后缀数组+贪心]
- C语言 定义一个整型二维数组，存放一个5×5的矩阵，要求从键盘输入矩阵的值，找出主对角线上其值最大的元素。主对角线如示例中1-4-9-16-25
- 【BZOJ1717】产奶的模式（后缀数组）
- 二分 - 寻找两个有序数组的中位数 - Leetcode 4
- c#数组转换成字符串的4种方法
- #include <> typedef struct Node { int index; struct Node *next; }JosephuNode; int Josephu(int n, int m) { int i, j; JosephuNode *head, *tail; head = tail = (JosephuNode *)malloc(sizeof(JosephuNode)); for (i = 1; i < n; ++i) { tail->index = i; tail->next = (JosephuNode *)malloc(sizeof(JosephuNode)); tail = tail->next; } tail->index = i; tail->next = head; for (i = 1; tail != head; ++i) { for (j = 1; j < m; ++j) { tail = head; head = head->next; } tail->next = head->next; printf("第%4d个出局的人是：%4d号\n", i, head->index); free(head); head = tail->next; } i = head->index; free(head); return i; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号！\n", Josephu(n, m)); system("pause"); return 0; }">设编号为1，2，… n的n个人围坐一圈，约定编号为k（1数组实现： #include <> #include <> int Josephu(int n, int m) { int flag, i, j = 0; int *arr = (int *)malloc(n * sizeof(int)); for (i = 0; i < n; ++i) arr[i] = 1; for (i = 1; i < n; ++i) { flag = 0; while (flag < m) { if (j == n) j = 0; if (arr[j]) ++flag; ++j; } arr[j - 1] = 0; printf("第%4d个出局的人是：%4d号\n", i, j); } free(arr); return j; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号！\n", Josephu(n, m)); system("pause"); return 0; } 链表实现： #include <> #include <> typedef struct Node { int index; struct Node *next; }JosephuNode; int Josephu(int n, int m) { int i, j; JosephuNode *head, *tail; head = tail = (JosephuNode *)malloc(sizeof(JosephuNode)); for (i = 1; i < n; ++i) { tail->index = i; tail->next = (JosephuNode *)malloc(sizeof(JosephuNode)); tail = tail->next; } tail->index = i; tail->next = head; for (i = 1; tail != head; ++i) { for (j = 1; j < m; ++j) { tail = head; head = head->next; } tail->next = head->next; printf("第%4d个出局的人是：%4d号\n", i, head->index); free(head); head = tail->next; } i = head->index; free(head); return i; } int main { int n, m; scanf("%d%d", &n, &m); printf("最后胜利的是%d号！\n", Josephu(n, m)); system("pause"); return 0; }
- 输入4*4的数组，编写程序实现找出数组中其值最大和最小的元素以及它们在数组中的位置。
- 【后缀数组】poj3581 Sequence
- [hdu4436 str2int]后缀自动机SAM（或后缀数组SA）
- 012-数据结构-树形结构-哈希树[hashtree]、字典树[trietree]、后缀树