Musical Theme
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <algorithm>
#include <climits>
using namespace std;
const int MAXN = 1e5 + 10;
int N;
int s[MAXN], sa[MAXN], rak[MAXN], tp[MAXN], tax[MAXN], height[MAXN], P, M;
void Qsort() {
for(int i = 0; i <= M; i++) tax[i] = 0;
for(int i = 1; i <= N; i++) tax[rak[i]]++;
for(int i = 1; i <= M; i++) tax[i] += tax[i - 1];
for(int i = N; i >= 1; i--) sa[ tax[rak[tp[i]]]-- ] = tp[i];
}
void SuffixSort() {
M = 233;
for(int i = 1; i <= N; i++) rak[i] = s[i], tp[i] = i;
Qsort();
for(int w = 1, p = 0; p < N; M = p, w <<= 1) {
p = 0;
for(int i = 1; i <= w; i++) tp[++p] = N - i + 1;
for(int i = 1; i <= N; i++) if(sa[i] > w) tp[++p] = sa[i] - w;
Qsort(); swap(tp, rak);
rak[sa[1]] = p = 1;
for(int i = 2; i <= N; i++)
rak[sa[i]] = (tp[sa[i]] == tp[sa[i - 1]] && tp[sa[i] + w] == tp[sa[i - 1] + w]) ? p : ++p;
}
int j = 0, k = 0;
for(int i = 1; i <= N; i++) {
if(k) k--;
int j = sa[rak[i] - 1];
while(s[i + k] == s[j + k]) k++;
height[rak[i]] = k;
}
// for(int i = 1; i <= N; i++) printf("%d ", sa[i]); puts("");
}
bool check(int x){
int mi=sa[1],ma=sa[1];
for(int i=2;i<=N;i++){
if(height[i]>=x){
mi=min(mi,sa[i]);
ma=max(ma,sa[i]);
if(ma-mi>x){
return 1;
}
}else{
mi=ma=sa[i];
}
}
return 0;
}
int main(){
while(scanf("%d",&N)!=EOF){
if(N==0) break;
for(int i=1;i<=N;i++) scanf("%d",&s[i]);
for(int i=N;i>=1;i--) s[i]=s[i]-s[i-1]+100;
SuffixSort();
int l=4,r=N/2,ans=-1;
while(l<r){
int mid=(l+1+r)/2;
if(check(mid)) l=mid;
else r=mid-1;
}
// cout<<check(l)<<endl;
if(l>=4&&check(l)){
printf("%d\n",l+1);
}else printf("0\n");
}
}
Milk Patterns
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <algorithm>
#include <climits>
using namespace std;
const int MAXN = 1e5 + 10;
int N,k;
int s[MAXN], sa[MAXN], rak[MAXN], tp[MAXN], tax[MAXN], height[MAXN], P, M;
void Qsort() {
for(int i = 0; i <= M; i++) tax[i] = 0;
for(int i = 1; i <= N; i++) tax[rak[i]]++;
for(int i = 1; i <= M; i++) tax[i] += tax[i - 1];
for(int i = N; i >= 1; i--) sa[ tax[rak[tp[i]]]-- ] = tp[i];
}
void SuffixSort() {
M = 233;
for(int i = 1; i <= N; i++) rak[i] = s[i], tp[i] = i;
Qsort();
for(int w = 1, p = 0; p < N; M = p, w <<= 1) {
p = 0;
for(int i = 1; i <= w; i++) tp[++p] = N - i + 1;
for(int i = 1; i <= N; i++) if(sa[i] > w) tp[++p] = sa[i] - w;
Qsort(); swap(tp, rak);
rak[sa[1]] = p = 1;
for(int i = 2; i <= N; i++)
rak[sa[i]] = (tp[sa[i]] == tp[sa[i - 1]] && tp[sa[i] + w] == tp[sa[i - 1] + w]) ? p : ++p;
}
int j = 0, k = 0;
for(int i = 1; i <= N; i++) {
if(k) k--;
int j = sa[rak[i] - 1];
while(s[i + k] == s[j + k]) k++;
height[rak[i]] = k;
}
}
multiset<int> ss;
int main(){
scanf("%d%d",&N,&k);
for(int i=1;i<=N;i++) scanf("%d",&s[i]);
SuffixSort();
for(int i=2;i<=k;i++) ss.insert(height[i]);
int ans=*(ss.begin());
for(int i=k+1;i<=N;i++){
ss.erase(ss.find(height[i-k+1]));
ss.insert(height[i]);
ans=max(ans,*ss.begin());
}
cout<<ans<<endl;
}
C - Distinct Substrings
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <algorithm>
#include <climits>
using namespace std;
const int MAXN = 1e5 + 10;
int N,k;
int s[MAXN], sa[MAXN], rak[MAXN], tp[MAXN], tax[MAXN], height[MAXN], P, M;
void Qsort() {
for(int i = 0; i <= M; i++) tax[i] = 0;
for(int i = 1; i <= N; i++) tax[rak[i]]++;
for(int i = 1; i <= M; i++) tax[i] += tax[i - 1];
for(int i = N; i >= 1; i--) sa[ tax[rak[tp[i]]]-- ] = tp[i];
}
void SuffixSort() {
M = 233;
for(int i = 1; i <= N; i++) rak[i] = s[i], tp[i] = i;
Qsort();
for(int w = 1, p = 0; p < N; M = p, w <<= 1) {
p = 0;
for(int i = 1; i <= w; i++) tp[++p] = N - i + 1;
for(int i = 1; i <= N; i++) if(sa[i] > w) tp[++p] = sa[i] - w;
Qsort(); swap(tp, rak);
rak[sa[1]] = p = 1;
for(int i = 2; i <= N; i++)
rak[sa[i]] = (tp[sa[i]] == tp[sa[i - 1]] && tp[sa[i] + w] == tp[sa[i - 1] + w]) ? p : ++p;
}
int j = 0, k = 0;
for(int i = 1; i <= N; i++) {
if(k) k--;
int j = sa[rak[i] - 1];
while(s[i + k] == s[j + k]) k++;
height[rak[i]] = k;
}
}
int T;
int main(){
scanf("%d",&T);
while(T--){
string tp;cin>>tp;N=tp.size();
for(int i=1;i<=N;i++) s[i]=tp[i-1];
SuffixSort(); long long sum=0;
for(int i=1;i<=N;i++){
// cout<<sa[i]<<" "<<height[i]<<endl;
sum+=N-sa[i]+1-height[i];
}
cout<<sum<<endl;
}
}