hdu6208

直接去个重，然后strstr判断子串就行

#include<bits/stdc++.h>


using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
#define PI acos(-1.0)
#define ITER set<int>::iterator
const int Mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int N = 2;

string s[maxn];
bool cmp(string a,string b)
{
    if(a.size() == b.size())
        return a < b;
    return a.size() < b.size();
}

int main()
{
    ios::sync_with_stdio(false);

    int Tcase;cin >> Tcase;
    while(Tcase --)
    {
        int n;cin >> n;;if(!n){cout << "No" << endl;continue;}
        for(int i = 1; i <= n;i ++)cin >> s[i];
        sort(s + 1,s + n + 1,cmp);n = unique(s + 1,s + n + 1) - s - 1;
        if(s[n].size() == s[n - 1].size()){cout << "No" << endl;;continue;}
        bool flag = true;
        for(int i = 1; i <= n - 1;i ++)
        {
            if(!strstr(s[n].c_str(),s[i].c_str())){flag = false;break;}
        }
        if(flag){cout << s[n] << endl;}
        else cout << "No" << endl;
    }
    return 0;
}

发现string :: find也行，find没找到的话返回的是string :: npos

#include<bits/stdc++.h>


using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
#define PI acos(-1.0)
#define ITER set<int>::iterator
const int Mod = 1e9 + 7;
const int maxn = 1e5 + 10;
const int N = 2;

string s[maxn];
bool cmp(string a,string b)
{
    if(a.size() == b.size())
        return a < b;
    return a.size() < b.size();
}

int main()
{
    ios::sync_with_stdio(false);

    int Tcase;cin >> Tcase;
    while(Tcase --)
    {
        int n;cin >> n;;if(!n){cout << "No" << endl;continue;}
        for(int i = 1; i <= n;i ++)cin >> s[i];
        sort(s + 1,s + n + 1,cmp);n = unique(s + 1,s + n + 1) - s - 1;
        if(s[n].size() == s[n - 1].size()){cout << "No" << endl;;continue;}
        bool flag = true;
        for(int i = 1; i <= n - 1;i ++)
        {
            if(s[n].find(s[i]) == string :: npos){flag = false;break;}
        }
        if(flag){cout << s[n] << endl;}
        else cout << "No" << endl;
    }
    return 0;
}