fork download
copy 
  1. #include <iostream>
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4.  
  5. int main() {
  6. 	// your code goes here
  7. 	vector<int>arr={1,0,1,1,0,2};
  8. 	int k=3;
  9. 	unordered_map<int,int>mpp;
  10. 	mpp[0]=-1;
  11. 	int maxlen=0;
  12. 	int sum=0;
  13. 	for(int i=0;i<arr.size();i++){
  14. 		sum+=arr[i];
  15. 		int rem=sum-k;
  16. 		if(mpp.find(sum-k)!=mpp.end()){
  17. 			int len=i-mpp[sum-k];
  18. 			maxlen=max(maxlen,len);
  19. 		}
  20. 		if(mpp.find(sum)==mpp.end())mpp[sum]=i;
  21. 	}
  22. 	cout<<maxlen;
  23. 	return 0;
  24. }
Success #stdin #stdout 0.01s 5308KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
5
https://ideone.com/HC2f2n
Longest sybaaray sum=k(hashing)
language:
C++ (gcc 8.3)
created:
7 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!