By using c++ .. Given an array of size n, each element contains either a 'P' for a policeman or a 'T' for a thief. Find the maximum number of thieves that the police can catch. Keep in mind the following conditions: 1. Each policeman can catch only one thief. 2. A policeman cannot catch a thief who is more than K units away from him. Example 1: Input: N = 5, K = 1 arr[] = {P, T, T, P, T} Output: 2 Explanation: Maximum 2 thieves can be caught. The first policeman catches the first thief and the second policeman can catch either the second or third thief. Example 2: Input: N = 6, K = 2 arr[] = {T, T, P, P, T, P} Output: 3 Explanation: Maximum of 3 thieves can be caught.

Your Friendly Array Neighbor   Program only in java not in python Create a Java program that takes an array called ar as an input that keeps track of arrays. Every day a new array is produced using the array of the previous day. On the n’th day, the following operations are performed on the array of day n – 1 to produce the array of day n:   -If an element is smaller than both left and right neighbor, then this element is incremented -If an element is bigger than both its left neighbor and its right neighbor, then this element is decremented. -The first and last elements should never change   Eventually after some days the array will not change, some examples:   Example: Input from user: ar = [6,2,3,4] Output from program: [6,3,3,4] After the first day the array is changed from [6,2,3,4] to [6,3,3,4] and no further operations may be completed.   Example: Input from user: ar = [1,6,3,4,3,5] Output from program: [1,4,4,4,4,5]   After the first day the array is changed from [1,6,3,4,3,5]…

Write a program in C that create a 3-by-5 array. All elements in the array are random integer numbers between 1 and 100. Then, put all elements of the two-dimensional array into a one-dimensional array. Finally, calculate the mean value and the median value of 1-D array. Print out the 2-D array, original 1-D array, sorted 1-D array, and the mean value and the median value of 1-D array.

Need help making C or java code for these steps :   Assume there are N=1,000 people in the small place. Use a simple array to record the status of each person, call it “infected”. For example, infected[1]=TRUE if user 1 is infected. Each infected individual may come into contact with ratio of all people in each round of infection. Each contact between an infected individual and a healthy individual has a chance of that the healthy individual will be infected.