B. Substrings Sort STL

B. Substrings Sort
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given
n
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
a is a substring of string
b
b if it is possible to choose several consecutive letters in
b
b in such a way that they form
a
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
n (
1
≤
n
≤
100
1≤n≤100) — the number of strings.

The next
n
n lines contain the given strings. The number of letters in each string is from
1
1 to
100
100, inclusive. Each string consists of lowercase English letters.

Some strings might be equal.

Output
If it is impossible to reorder
n
n given strings in required order, print “NO” (without quotes).

Otherwise print “YES” (without quotes) and
n
n given strings in required order.

题解：

STL中find的妙用，npos表示没找到。
思维退化啊最近。

代码：

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

const int maxn = 100+10;
string str[maxn];

bool cmp(string a,string b)
{
    return a.size()<b.size();
}

int main()
{
    int n;
    cin>>n;

    for(int i=0;i<n;i++)
    {
        cin>>str[i];
    }
    sort(str,str+n,cmp);
    //bool flag = false;
    for(int i=1;i<n;i++)
    {
       if(str[i].find(str[i-1])==str[i].npos)
       {
            puts("NO");
            return 0;
       }
    }
    puts("YES");
    for(int i=0; i<n; i++)
        cout<<str[i]<<endl;
    return 0;
}