Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int find_subarray(long int a[],int n,int z);
- int main()
- {
- int t,i;
- scanf("%d",&t);
- for(i=0; i<t; i++)
- {
- int n,z,j;
- scanf("%d %d",&n,&z);
- long int a[10000];
- for(j=0; j<n; j++)
- scanf("%ld",&a[j]);
- int result=find_subarray(a,n,z);
- printf("%d\n",result);
- }
- return 0;
- }
- int find_subarray(long int a[],int n,int z)
- {
- int i,j,pos;
- long int min=10000000000002;
- long int sum;
- for(i=0; i<=n-z; i++)
- {
- sum=a[i];
- for(j=i+1; j<i+z; j++)
- sum=a[j]^sum;
- if(sum<=min)
- {
- min=sum;
- pos=i;
- }
- }
- return pos+1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement