hdu 5400

Arithmetic Sequence
Time Limit: 2000msMemory Limit: 65536KB This problem will be judged on HDU. Original ID: 5400
64-bit integer IO format: %I64d Java class name: Main
Prev Submit Status Statistics Next
Type:
None

Tag it!
A sequence b1,b2,⋯,bn are called (d1,d2)-arithmetic sequence if and only if there exist i(1≤i≤n) such that for every j(1≤j

#include<cstdio>
#include<iostream>
typedef long long ll;
using namespace std;
ll num[111111];
int main()
{
    int n, d1, d2;
    while (~scanf("%d%d%d",&n,&d1,&d2))
    {
        ll x, y;
        scanf("%lld", &x);
        for (int i = 1; i < n; i++)
        {
            y = x;
            scanf("%lld", &x);
            num[i] = x-y;
        }
        num[n] = 2111;
        int f = 1;
        ll ans = 0, s = 0;
        for (int i = 1; i <= n; i++)
        {
            if (num[i] == d1&&f)
                s++;
            else if (num[i] == d2)
            {
                s++;
                f = 0;
            }
            else
            {
                ans += ((s + 1)*s / 2);
                f = 1;
                s = 0;
                if (num[i] == d1) s++;
            }
        }
        cout << ans+n << endl;
    }
    return 0;
}