CF 121E

题目：http://codeforces.com/problemset/problem/121/E

解决这题的关键是这句话。The operations are such that after all additions the array won't have numbers that would exceed 10^4。

也就是说。所有操作的和不超过10000。 

那么可以想到用树状数组,sum(x)表示下标1-x内幸运数的个数。那么区间[l,r]即 等于 sum(r)-sum(l-1).

#include <cmath>
#include <ctime>
#include <iostream>
#include <string>
#include <vector>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <cctype>
#include <stack>
#include <deque>
using namespace std;
typedef long long LL;
#define eps 10e-9
#define inf 0x3f3f3f3f
const int maxn = 100000+100;
int a[maxn],c[maxn];
bool lucky[maxn];
bool cheak(int n){
    int res;
    while(n){
       res=n%10; n/=10;
       if(res!=4&&res!=7) return false;
    }
    return true;
}
int lowbit(int x){ return x&-x; }
void add(int x,int d){
    while(x<maxn){
          c[x]+=d; x+=lowbit(x);
    }
}
int sum(int x){
    int ret=0;
    while(x>0){
         ret+=c[x];x-=lowbit(x);
    }
    return ret;
}
int main(){
    for(int i=1;i<=10000;i++){
        if(cheak(i)){
          lucky[i]=true;
        }else lucky[i]=false;
    }
    int n,m; scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
         scanf("%d",&a[i]);
         if(lucky[ a[i] ]){
              add(i,1);
         }
    }
    char op[10];  int l,r,v;
    while(m--){
          scanf("%s",op);
          if(op[0]=='c'){
              scanf("%d %d",&l,&r);
              printf("%d\n",sum(r)-sum(l-1));
          }
          else{
              scanf("%d %d %d",&l,&r,&v);
              for(int i=l;i<=r;i++){
                  if(lucky[ a[i] ]){
                      add(i,-1);
                  }
                  a[i]+=v;
                  if(lucky[ a[i] ]){
                      add(i,1);
                  }
              }
          }
    }
    return 0;
}