Differential summary

Blue Book recently seen the difference, found himself does not really understand, CSP exam before there was a bare differential problem I always use to write the tree line, now made several questions, feel deeper understanding of the check points

Given a number of columns \ (A [I] \) , check the score column \ (b [i] = a [i] -a [i-1] \)

    for(int i=1; i<=n; i++)
    {
        scanf("%d",&a[i]);
        if(i!=1)
            b[i]=a[i]-a[i-1];
    }

If the sequence \ (a [i] \) is 152793

Then the number of columns \ (b [i] \) is 04-352-6

Poor scores listed some interesting properties can be achieved \ (O (1) \) interval plus, but the query need to \ (O (n) \) the number of recovery column and then check if the interval plus the process is not output, the difference is a good way to problem-solving

This question is a good question Difference