洛谷 P1001 A+BProblem（树状数组）

洛谷 P1001 A+BProblem

---

树状数组解法

//树状数组解A+B
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<iomanip>
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
using namespace std;
using namespace std;
int a[3],c[3],s[3],ans,n=2;
int lowbit(int x)
{
    return -x&x;
}
int main()
{
    memset(c,0,sizeof(c));
    s[0]=0;
    for(int i=1;i<=2;i++){
        scanf("%d",&a[i]);
        s[i]=s[i-1]+a[i];
        c[i]=s[i]-s[i-lowbit(i)];
    }
    int s1=0,s2=0,flag=2;
    while(flag>0){
        s2+=c[flag];
        flag-=lowbit(flag);
    }
    ans=s2-s1;
    printf("%d",ans);
    return 0;
}
//A+B好难