fork download 
  1. #include <iostream>
  2. #include<stdio.h>
  3. #include<memory.h>
  4. #include<limits.h>
  5. #include<string.h>
  6. using namespace std;
  7.  
  8. char str[100005];
  9. int hashmap[300];
  10. int main() 
  11. {
  12. 	int a[2] = {0};
  13. 	int b[2] = {10,11};
  14. 	cout << "a[0]:" << a[0] << " a[1]:" << a[1] << endl;
  15. 	cout << "b[0]:" << b[0] << " b[1]:" << b[1] << endl;
  16. 	memcpy(&a[0],&b[0],(sizeof(int)*2));
  17. 	cout << "a[0]:" << a[0] << " a[1]:" << a[1] << endl;
  18. 	cout << "b[0]:" << b[0] << " b[1]:" << b[1] << endl;
  19.  
  20. #if 0
  21. 	int t,n,i,j,maxlen,prev_index,cur_len;
  22. 	scanf("%d",&t);
  23. 	while(t--)
  24. 	{
  25. 		memset(hashmap,-1,sizeof(hashmap));
  26. 		scanf("%s",str);
  27. 		maxlen=1;
  28. 		cur_len=1;
  29. 		hashmap[str[0]]=0;
  30. 		n=strlen(str);
  31. 		for(i=1;i<n;i++)
  32. 		{
  33. 			prev_index=hashmap[str[i]];
  34.  
  35. 			if(prev_index==-1||i-cur_len>prev_index)
  36. 			{
  37. 				cur_len++;
  38. 			}
  39. 			else
  40. 			{
  41. 				if(maxlen<cur_len)
  42. 				maxlen=cur_len;
  43.  
  44. 				cur_len=i-prev_index;
  45. 			}
  46. 			hashmap[str[i]]=i;
  47. 		}
  48. 		if(cur_len>maxlen)
  49. 		maxlen=cur_len;
  50.  
  51. 		printf("%d\n",maxlen);
  52. 	}
  53. #endif
  54. 	// your code goes here
  55. 	return 0;
  56. }
Success #stdin #stdout 0.01s 5292KB
comments (?)
stdin 
10
aba
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
geeksforgeeks
stdout 
a[0]:0 a[1]:0
b[0]:10 b[1]:11
a[0]:10 a[1]:11
b[0]:10 b[1]:11
https://ideone.com/r1HUP9
language:
C++ (gcc 8.3)
created:
12 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!