1 solutions

  • 1
    @ 2026-1-25 14:42:43
    #include<bits/stdc++.h>
    using namespace std;
    typedef long long LL;
    const int N=2e5+10;
    LL a[N],s[N];
    int main(){
    	LL n,k;
    	cin>>n>>k; 
    	for(int i=1;i<=n;i++){
    		cin>>a[i];
    	}
    	for(int i=1;i<=n;i++){
    		s[i]=s[i-1]+a[i]; 
    	} 
    	map<LL,LL> h;
    	h[0]=1;
    	LL ans=0;
    	for(int i=1;i<=n;i++){
    		ans+=h[s[i]-k];
    		h[s[i]]++;
    	}
    	cout<<ans;
    	return 0;
    }
    
    • 1

    Information

    ID
    2742
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    3
    Tags
    # Submissions
    16
    Accepted
    7
    Uploaded By