洛谷P2671 前缀和+算贡献

//P2671 n<1e5个数 col,num<1e5 每个数有颜色col 价值num  
//三元组(x,y,z)的价值为(x+z)*(num(x)+num(z)) 
//三元组满足 x<y<z 且 y-x=z-y 且 x跟z的颜色相同        
//统计所有三元组的价值对10007取模
//统计4个前缀和 边统计边算每个z的贡献  分奇偶统计
#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i++)
using namespace std;
const int mod=10007;
ll dp1[100005][2];//颜色i是否为奇数的下标个数的前缀和 
ll dp2[100005][2];//下标的前缀和
ll dp3[100005][2];//num(下标)的前缀和
ll dp4[100005][2];//下标*num(下标)的前缀和
ll num[100005];
ll col[100005];


int main()
{
    int m,n;cin>>n>>m;
    for(int i=1;i<=n;i++)cin>>num[i];
    for(int i=1;i<=n;i++)cin>>col[i];
    ll ans=0;

    for(ll i=1;i<=n;i++){

        if(dp1[col[i]][i&1]>0){
            (ans+=1ll*i*num[i]%mod*dp1[col[i]][i&1]%mod)%=mod;
            (ans+=1ll*i           *dp3[col[i]][i&1])%=mod;
            (ans+=1ll*num[i]      *dp2[col[i]][i&1])%=mod;
            (ans+=1ll             *dp4[col[i]][i&1])%=mod;
        }

        (dp1[col[i]][i&1]+=1)%=mod;
        (dp2[col[i]][i&1]+=i)%=mod;
        (dp3[col[i]][i&1]+=num[i])%=mod;
        (dp4[col[i]][i&1]+=i*num[i]%mod)%=mod;
    }
    cout<<ans%mod<<endl;
    system("pause");
}