高效的遍历方法---尺取法

尺取法

本质： 尺取法的本质实际上是一种高效模拟，它其实也是一种暴力枚举的方法，但是这种枚举更加的高效。
过程： 通过两个指针l,r的移动，去不断地截取满足自己条件的区间，首先是是右指针的移动，移动到初步所满足的区间内，右指针保持不动，移动左指针进行判断，这个时候出现两种判断结果，第一种是这种左移是符合条件的，那么保持右指针不变，左指针继续向左移动；第二种是这种左移是不符合条件的，那么继续右指针的移动，直到符合条件位置。不断重复这种过程，最后完成所有的遍历。
放一张图出来，聪明的你应该就能看懂了。

何时选择：
使用尺取法要明确几个问题：1、 什么情况下能使用尺取法? 2、何时推进区间的端点？ 3、如何推进区间的端点？ 4、何时结束区间的枚举？
尺取法通常适用于选取区间有一定规律，或者说所选取的区间有一定的变化趋势的情况，通俗地说，在对所选取区间进行判断之后，我们可以明确如何进一步有方向地推进区间端点以求解满足条件的区间，如果已经判断了目前所选取的区间，但是所求解的区间无法由区间的端点而得到，那么尺取法便是不可行的，因为我们能够控制的是区间的端点。首先，明确题目所需要求解的量之后，区间左右端点一般从最整个数组的起点开始，之后判断区间是否符合条件在根据实际情况变化区间的端点求解答案。
模板代码： 模板代码可能有很多种，我这里仅提供两种我认为方便记忆的写法。
第一种是不一定要遍历完的，找到最小的退出即可。
第二种是要遍历完的，

#include <bits/stdc++.h>
using namespace std;
const int N=1e4+5;
int n,res,goal,a[N];//n表示数组中元素的个数,goal表示目标区间的元素个数
void ruler()
{
    int l,r,sum;
    l=r=0;res=N;
    while(1)
    {
        while(r<n&&sum<goal)
        {
            if()sum+=a[r];
            r++;
        }
        if(sum<goal||l>n)break;
        res=min(res,l-r+1);//因为r和l是从0开始的所以要+1
        if()sum-=a[l];
        l++
    }
}

#include <bits/stdc++.h>
using namespace std;
const int N=1e4+5;
string str;
map<char,int>vis;
int n,num,res=N;
void ruler()
{
    int l,r;
    for(l=0,r=0;r<n;r++)
    {
        vis[str[r]]++;
        if()num++;
        if()continue;
        while()
        {
            vis[str[l]]--;
            l++;
        }
        res=min(res,r-l+1);
    }
}

例题： 例题来源于NEFUOJ与POJ
1.尺取-字符串
描述：小N现在有一个字符串S。他把这这个字符串的所有子串都挑了出来。一个S的子串T是合法的，当且仅当T中包含了所有的小写字母。小N希望知道所有的合法的S的子串中，长度最短是多少。
输入：一行一个字符串S。只包含小写字母。S的长度不超过106.
输出：一行一个数字，代表最短长度。数据保证存在一个合法的S的子串。
思路：这个题的意思就是我们的区间内要包含所有的小写的26个字母，并且这个区间是最小的，所以我们要先找到包含26个小写字母的区间，然后再不断地缩小区间找到最小的那个，这是最顺利的一种情况，也可能我们先找到比较小的区间，然后我们再找到最小的区间的情况，即有多个区间，所以我们还是要把整个区间找完的。

#include <bits/stdc++.h>
using namespace std;
const int N=200;
string str;
map<char,int>vis;
int num,res=N;
void ruler(string str)
{
    int l,r;
    for(l=0,r=0;r<str.length();r++)
    {
        vis[str[r]]++;
        if(vis[str[r]]==1)num++;
        if(num<26)continue;
        while(vis[str[l]]>1)
        {
            vis[str[l]]--;
            l++;
        }
        res=min(res,r-l+1);
    }
    cout<<res;
}
int main()
{
    cin>>str;
    ruler(str);
    return 0;
}

2.NEFUOJ-1815
思路：我们先移动r指针找到包含所有内容连续序列，然后再进一步移动l指针去找最小的区间，找到就退出，这个题用map会超时，因为它查找的时候最坏的情况是O（n），所以这种对于数字的映射，还是用数组就行。

#include <bits/stdc++.h>
using namespace std;
#define N 1000010
#define MAXN 10000005
int vis[N];
set<int>tmp;
int n,res,num,a[N];
int main()
{
    scanf("%d",&n);
    for(int i=0; i<n; i++)
    {
        scanf("%d",&a[i]);
        tmp.insert(a[i]);
    }
    int k=tmp.size();
    int l,r;
    l=r=0;
    res=MAXN;
    while(1)
    {
        while(r<n&&num<k)
        {
            if(!vis[a[r]])num++;
            vis[a[r]]++;
            r++;
        }
        //printf("%d\n",num);
        if(num<k)break;
        res=min(res,r-l);
        vis[a[l]]--;
        if(vis[a[l]]==0)num--;
        l++;
    }
    printf("%d\n",res);
    return 0;
}

3.P0J-2739
思路：这个题我们要先用素数筛打一个表出来，由于它是很多个连续的不同区间，我们就可以用双重循环去不断的判断。

#include <bits/stdc++.h>
using namespace std;
/*const int N=1e4+5;
int prime[N];
bool b[N];
void get_prime()
{
    int i,j,num=0;
    memset(b,1,sizeof(b));
    b[0]=b[1]=1;
    for(i=2; i<=N; i++)
    {
        if(b[i])
        {
            prime[++num]=i;
            //printf("%d,",prime[num]);
        }
        for(j=1; j<=num&&prime[j]*i<=N; j++)
        {
            b[prime[j]*i]=0;
            if(i%prime[j]==0)break;
        }
    }
    printf("%d",num);
}*/
const int N=1229;
int n,sum,num;
int i,j;
int a[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,7927,7933,7937,7949,7951,7963,7993,8009,8011,8017,8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,8221,8231,8233,8237,8243,8263,8269,8273,8287,8291,8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,8513,8521,8527,8537,8539,8543,8563,8573,8581,8597,8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,8747,8753,8761,8779,8783,8803,8807,8819,8821,8831,8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,9013,9029,9041,9043,9049,9059,9067,9091,9103,9109,9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,9293,9311,9319,9323,9337,9341,9343,9349,9371,9377,9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,9539,9547,9551,9587,9601,9613,9619,9623,9629,9631,9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,9817,9829,9833,9839,9851,9857,9859,9871,9883,9887,9901,9907,9923,9929,9931,9941,9949,9967,9973};
int main()
{
    //get_prime();
    while(cin>>n)
    {
        if(n==0)break;
        num=0;
        for(i=0;i<1229;i++)
        {
            if(a[i]>n)break;
            sum=0;
            for(j=i;j<1229&&a[j]<=n;j++)
            {
                //printf("%d**%d ",sum,j);
                sum+=a[j];
                if(sum>n){//printf("\n");
                           break;}
                if(sum==n)num++;
            }
        }
        cout<<num<<endl;
    }
    return 0;
}

4.POJ-2100
**思路：**题目的意思是我们有多少种不同的平方数加起来等于n，在输出中它既要，种类又要每一种的组成，所以我们就用两个数组，分别储存每次满足它区间的左端点和右端点，然后每组输出从左端点到右端点的值即可，这里面要注意的细节是：如果一个数字大于n开方的数字，那么这个数字的平方一定大于n，所以我们的左右端点判断到对n开方的数字即可。
（由于上面的那个题要打表，我还傻傻的去打表，直到发现打不出1e14，不过打表真香啊，下次还敢）
代码：

#include <bits/stdc++.h>
using namespace std;
const int N=2e3;
typedef long long ll;
ll n,num,a[N],Left[N],Right[N],coculm[N];
ll sum,l,r,i,j;
int main()
{
    while(scanf("%lld",&n)!=EOF)
    {
        ll tmp=(ll)sqrt(n*1.0);
        r=sum=num=0;l=1;
        while(1)
        {
            while(sum<n)
            {
                r++;
                sum+=r*r;
            }
            if(r>tmp||l>tmp)break;
            if(sum==n)
            {
                coculm[num]=r-l+1;
                Left[num]=l;
                Right[num]=r;
                num++;
            }
            sum-=(l*l);
            l++;
        }
        printf("%lld\n",num);
        for(i=0; i<num; i++)
        {
            printf("%lld ",coculm[i]);
            for(j=Left[i]; j<=Right[i]; j++)
                printf("%lld ",j);
                printf("\n");
            //printf("%lld\n",Right[i]);
        }
    }
    return 0;
}

最后： 关于何时采用尺取法的部分参考了https://blog.csdn.net/lxt_lucia/article/details/81091597的博客，在此致谢。