GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Buildings receiving sunlight
Submit Your Solution :- Click Here
Solution :-
#include<iostream>
using namespace std;
int main()
{
int T, N, H[100], max, count=0, i;
cin >> T;
while(T--)
{
count = 0;
max = -10;
cin >> N;
for(i=0; i<N; i++)
{
cin >> H[i];
if(H[i]>=max)
{
max = H[i];
count++;
}
}
cout << count << endl;
}
return 0;
}
Output:-
0 Comments: