NEUQ-2021寒假训练-字符串

A - Page Numbers

#include <iostream>
#include <vector>
#include <set>
using namespace std;

int x;
set <int> t;
vector <int> a;
int start, last; 

int main()
{
	while (scanf ("%d", &x))
	{
		t.insert (x);
		if (getchar() == '\n') break;
	}
	
	for (auto it : t)
	{
		a.push_back (it);
	}
	
	start = last = a[0];	
	for (int i = 1; i < a.size(); i ++)
	{
		if (a[i - 1] != a[i] - 1)
		{
			if (start != last) printf ("%d-%d,", start, last);
			else printf ("%d,", last);
			start = a[i];
		}
		last = a[i];
	}
	
	if (start != last) printf ("%d-%d", start, last);
	else printf ("%d", last);
	
	return 0;
}

B - 最长回文

#include<iostream>
#include<algorithm>
using namespace std;

const int maxn = 110000;

int dp[maxn * 2 + 5];
char str[maxn * 2 + 5];
char S[maxn + 5];

int manacher (char *s) 
{
	int n = 0, len = strlen(s + 1);
	
	str[0] = '$';
	for(int i = 1; i <= len; i ++) 
	{
		str[++ n] = '#';
		str[++ n] = s[i];
	}
	str[++ n]='#',str[++ n]='@';
	
	int right = 0, center = 0;
	for(int i = 1; i <= n; i ++) 
	{
		if (i < right) dp[i] = min (dp[2 * center - i], right - i);	
		else dp[right = i]=1;
			
		while(str[i - dp[i]] == str[i + dp[i]]) dp[i] ++;
			
		if(i + dp[i] > right) 
		{
			right = i + dp[i];
			center = i;	
		}
	}
	
	int ret = 0;
	for(int i = 1; i <= n; i ++)
	{
		ret = max (ret, dp[i] - 1);
	}
	return ret;
}

int main() 
{
	while (~scanf("%s", S + 1))
	{
		printf("%d\n", manacher(S));
	}
	return 0;	
}

C - 剪花布条

#include <iostream>
using namespace std;

const int maxn = 1000 + 5;
char s[maxn],p[maxn];
int nex[maxn];
int sum;

void getnext ();
void kmp ();

int main () 
{
	while (~scanf("%s", &s)) 
	{
		if (s[0] == '#') break;
		scanf ("%s", &p);
		sum = 0;
		getnext ();
		kmp ();
		printf("%d\n", sum);
	}
	return 0;
}

void getnext ()
{
	nex[0] = -1;
	int i = 0, j = -1;
	while (i < strlen(p)) 
	{
		if (j == -1 || p[i] == p[j]) 
		{
			i ++;
			j ++;
			nex[i] = j;
		} 
		else
		{
			j = nex[j];
		}	
	}
	return;
}

void kmp () 
{
	int i = 0, j = 0;
	int len1 = strlen(s), len2 = strlen(p);
	while (i < len1) 
	{
		if(j == -1|| s[i] == p[j]) 
		{
			i ++;
			j ++;
		} 
		else
		{
			j = nex[j];
		}
		if(j == len2) 
		{
			sum ++;
			j = -1;
			i --;
		}
	}
	return;
}

D - 统计难题

#include<iostream>
using namespace std;

const int maxn = 1e6 + 5;
const int maxm = 10 + 5;
int trie[maxn][26];
int num[maxn] = {0};
char s[maxm];
int pos = 1;

void insert(char s[]) 
{
    int p = 0;
    for (int i = 0; s[i]; i ++) 
	{
        int n = s[i] - 'a';
        if (trie[p][n] == 0) trie[p][n] = pos++;
        p = trie[p][n];
        num[p] ++;
    }
}

int find (char s[]) 
{
    int p = 0;
    for (int i = 0; s[i]; i++) 
	{
        int n = s[i] - 'a';
        if (trie[p][n] == 0) return 0;   
        p = trie[p][n];
    }
    return num[p];
}

int main ()
{
    while (gets(s) && s[0] != '\0') insert(s);    
    while (~scanf("%s", s)) printf("%d\n", find(s));
    return 0;
}

E - 单词数

#include <iostream>
#include <sstream>
#include <set>
using namespace std;

set <string> words;
string s, w;
 
int main()
{
    while (getline (cin, s) && s != "#") 
	{
		words.clear();
        istringstream sin (s);
        while (sin >> w)
        {
			words.insert (w);
		}
        cout << words.size() << endl;
    }
    return 0;
}