蓝桥杯 ALGO-87 子串统计（stl）

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;

#define MAX 60+5

struct SubStr
{
char str[MAX];
int t;
};
vector<SubStr> substr;
vector<SubStr>::iterator Iter;

void check(char temp[])
{
int flag = 1;
for (Iter = substr.begin(); Iter != substr.end(); Iter++)
{
if (!strcmp(((*Iter).str), temp))
{
(*Iter).t++;
return;
}
}
if (flag)
{
SubStr ss;
strcpy(ss.str, temp);
ss.t = 1;
substr.push_back(ss);
}
}

int main()
{
//freopen("in.txt", "r", stdin);
int n = 0, i = 0, j = 0, k = 0;
char str[MAX];

//input
cin >> n;
cin >> str;
for (i = 1; i < strlen(str); i++)
{
for (j = 0; j <= i; j++)
{
int l = 0;
char temp[MAX];;
for (k = j; k <= i; k++)
{
temp[l++] = str[k];
}
temp[l] = '\0';
check(temp);
}
}

//output
int max_t = 0, max_len = 0;
char res[MAX];
for (Iter = substr.begin(); Iter != substr.end(); Iter++)
{
if (strlen((*Iter).str) >= n)
{
if ((*Iter).t > max_t)
{
max_t = (*Iter).t;
strcpy(res, (*Iter).str);
max_len = strlen((*Iter).str);
}
else if ((*Iter).t == max_t)
{
if (strlen((*Iter).str) > max_len)
{
max_t = (*Iter).t;
strcpy(res, (*Iter).str);
max_len = strlen((*Iter).str);
}
}
}
}
if (n != 0)
cout << res;
}