first_negative_integer_in_window.cpp

/*
Given an array and a positive integer k, find the first negative integer for each and every window(contiguous subarray) of size k.
Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer n denoting the size of the array. The next line contains n space separated integers forming the array. The last line contains the window size k.
Output:
Print the space separated negative integer starting from the first till the end for every window size k. If a window does not contain a negative integer , then print 0 for that window.
Constraints:
1<=T<=10^5
1<=n<=10^5
1<=a[i]<=10^5
1<=k<=n
Example:
Input:
2
5
-8 2 3 -6 10
2
8
12 -1 -7 8 -15 30 16 28
3
Output:
-8 0 -6 -6
-1 -1 -7 -15 -15 0
*/
#include<bits/stdc++.h>
using namespace std;
int findd(int low,int high,int a[]){
    for(int i=low;i<high;i++)
        if(a[i]<0)
            return a[i];
    return 0;
}
int main() {
	//code
	int t;
	cin>>t;
	while(t--){
	    int n,k;
	    cin>>n;
	    int a[n];
	    for(int i=0;i<n;i++)
	        cin>>a[i];
	    cin>>k;
	    for(int i=0;i<=n-k;i++)
	        cout<<findd(i,i+k,a)<<" ";
	        cout<<endl;
	}
	return 0;
}