Problem A. Common Anagrams Google Kickstart Round F 2018

题意：两个字符串A,B，问有多少对子串是anagrams（含有相同的字母，orderless）

枚举子串的长度l，维护一个sliding windown frequqncy array。frequency从左往右移动，最左边移除的字母对应的频率减一，最右边新加入的字母频率加一，再比较AB两个子串的frequency array是否相同。

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<string>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<ctime>
using namespace std;

//Kickstart Round E Problem A. Common Anagrams

const int maxn=30;
const int maxl=51;
int T;
string A;
string B;
int L;
int freqA[maxn];
int freqB[maxn];
int ans;
void print_freq(int freq[])
{
    for(int i=0;i<26;i++)
    {
        cout<<freq[i]<<" ";
    }
    cout<<endl;
}
int main()
{

//    freopen("input.txt","r",stdin);
    freopen("A-small-practice.in","r",stdin);
    freopen("A.txt","w",stdout);
    clock_t START_TIME;
    clock_t FINISH_TIME;
    START_TIME=clock();
    scanf("%d",&T);

    for(int ca=1;ca<=T;ca++)
    {
        memset(freqA,0,sizeof(freqA));
        memset(freqB,0,sizeof(freqB));
        ans=0;
        cin>>L;
        cin>>A;
        cin.ignore();
        cin>>B;
//        cout<<A<<" "<<B<<endl;
        for(int l=1;l<=L;l++)
        {
            memset(freqA,0,sizeof(freqA));

            int cnt=0;
            for(int i=0;i<l-1;i++)
            {
                freqA[A[i]-'A']++;
            }
            for(int i=0;i+l<=L;i++)
            {
                freqA[A[i+l-1]-'A']++;
//                cout<<l<<" "<<i<<" A "<<A[i+l-1]-'A'<<endl;
//                print_freq(freqA);
                //check in B
                memset(freqB,0,sizeof(freqB));
                for(int j=0;j<l-1;j++)
                {
                    freqB[B[j]-'A']++;
                }
                for(int j=0;j+l<=L;j++)
                {
                    freqB[B[j+l-1]-'A']++;
                    //check if equal
                    bool flg=true;
                    for(int k=0;k<26;k++)
                    {
                        if(freqB[k]!=freqA[k])
                        {
                            flg=false;
                            break;
                        }
                    }
                    if(flg==true)
                    {
                        ans++;
                        break;

                    }
                    freqB[B[j]-'A']--;

                }
                freqA[A[i]-'A']--;

            }

        }
        printf("Case #%d: %d\n",ca,ans);
        cerr<<"finish case "<<ca<<endl;

    }

    FINISH_TIME=clock();
    cerr<<1.0*(FINISH_TIME-START_TIME)/CLOCKS_PER_SEC <<" (s) "<<endl;
    return 0;
}