BGI/BASE/src/2bwt/printSortedSuffix.cpp

   1 #include <iostream>
   2 #include <algorithm>
   3 #include <string>
   4 #include <vector>
   5
   6 using namespace std;
   7 int main() {
   8     string buf;
   9     cin >> buf;
  10     vector<string> vs;
  11     for (int i = 0; i < buf.length(); ++i) {
  12         buf = buf[buf.length()-1] + buf.substr(0, buf.length() - 1);
  13         vs.push_back(buf);
  14     }
  15     sort(vs.begin(), vs.end());
  16     for (int i = 0; i < vs.size(); ++i) {
  17         cout << vs[i] << endl;
  18         cerr << vs[i][vs[i].length() - 1];
  19     }
  20     cerr << endl;
  21     return 0;
  22 }