hihocoder1766 字符串问题

思路：

不断贪心增加即可。

实现：

 #include <iostream>
 #include <cstring>
 using namespace std;
 int ne[][];
 int main()
 {
     string s;
     while (cin >> s)
     {
         memset(ne, , sizeof ne);
         int n = s.length();
         for (int i = ; i < ; i++) ne[n][i] = n;
         for (int i = n - ; i >= ; i--)
         {
             for (int j = ; j < ; j++)
                 ne[i][j] = ne[i + ][j];
             ne[i][s[i] - 'a'] = i;
         }
         int ans = ;
         for (int i = ; i < n; i++)
         {
             int j = i, cur = ;
             while (j < n)
             {
                 if (ne[cur][s[j] - 'a'] < i)
                 {
                     cur = ne[cur][s[j] - 'a'];
                     cur++;
                     j++;
                 }
                 else break;
             }
             ans++;
             i = max(i, j - );
         }
         cout << ans << endl;
     }
     return ;
 }