1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
struct H{
    vector<int> group;
    int t;
    H(vector<int> group1,int t1)
    {
        group = group1;
        t = t1;
    }
    bool operator()(int a,int b)
    {
        if(group[a] != group[b])
        return group[a] < group[b];
        return group[a + t] < group[b + t];
    }
}; 
vector<int> getsiffux(vector<int> s)
{
    int n = s.size();
    int i;
    vector<int> group(n+1);
    for(i = 0;i < n;i++)
    group[i] = s[i];
    int t = 1;
    group[n] = -1;
    vector<int> perm(n);
    for(i = 0;i < n;i++)
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX