int maxSatisfied(int* cu, int cu_len, int* arr, int arr_len, int X){
int i, j, k;
int max = 0;
int cnt = 0;
int last;
for(i=0; i<=cu_len-X; i++){
if(i==0){
cnt = 0;
for(k=0; k<cu_len; k++){
if(k>=i && k<i+X){
cnt += cu[k];
}else{
cnt += (arr[k] == 0) ? cu[k] : 0;
}
}
last = cnt;
max = last;
}else{
cnt = last;
if(arr[i-1] == 1)
cnt -= cu[i-1];
if(arr[i+X-1] == 1){
cnt += cu[i+X-1];
}
if(cnt > max)
max = cnt;
last = cnt;
printf("cnt = %d \n");
}
}
return max;
}
