Codeforces988B——Substrings Sort

You are given n strings. Each string consists of lowercase English letters. Rearrange (reorder) the given strings in such a way that for every string, all strings that are placed before it are its substrings.
String a is a substring of string b if it is possible to choose several consecutive letters in b in such a way that they form a. For example, string “for” is contained as a substring in strings “codeforces”, “for” and “therefore”, but is not contained as a substring in strings “four”, “fofo” and “rof”.
Input
The first line contains an integer n (1≤n≤100) — the number of strings.
The next n lines contain the given strings. The number of letters in each string is from 1 to 100, inclusive. Each string consists of lowercase English letters.
Some strings might be equal.
Output
If it is impossible to reorder n given strings in required order, print “NO” (without quotes).
Otherwise print “YES” (without quotes) and n given strings in required order.
Examples
Input
5
a
aba
abacaba
ba
aba
Output
YES
a
ba
aba
aba
abacaba
Input
5
a
abacaba
ba
aba
abab
Output
NO
Input
3
qwerty
qwerty
qwerty
Output
YES
qwerty
qwerty
qwerty

排序然后暴力匹配就行
看了网上的代码…居然可以if (str.find("abc") == string::npos) { ... }

代码：

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;
string ss[105];
int n;
bool cmp(string a,string b){
    if(a.size()==b.size()){
        return a.compare(b)<0;
    }
    return a.size()<b.size();
}
bool check(int a,int b){
    if(ss[a].compare(ss[b])==0){
        return true;
    }
    int al=ss[a].size();
    int bl=ss[b].size();
    int i=0;
    int j=0;
    while(i<bl && j<al){
        if(ss[b][i]==ss[a][j]){
            i++;
            j++;
        }
        else{
            i-=(j-1);
            j=0;
        }
    }
    if(j==al){
        return true;
    }
    else{
        return false;
    }
}
int main(void){
    //freopen("data.txt","r",stdin);
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        cin >> ss[i];
    }
    sort(ss,ss+n,cmp);
    int flag=0;
    for(int i=0;i<n-1;i++){
        if(!check(i,i+1)){
            flag=1;
            break;
        }
    }
    if(flag){
        printf("NO\n");
    }
    else{
        printf("YES\n");
        for(int i=0;i<n;i++){
            cout << ss[i] << endl;
        }
    }
    return 0;
}