Sofdor Ali and Histogram

The Great Sofdor Ali is now interested in competitive programming. Seeing this, his friend and also …

Click here to read the complete problem statement.


If you need help solving this problem, mention your approach and ask specific questions. Please avoid sharing your code and asking the Community to figure out “what’s wrong”.

is there diagram require??

1 Like

Thanks for reporting this. The statement has been fixed.

what is the problem here? anyone can help?
got wa in 13no. test case…

#include

using namespace std;

int main() {
int T,i;
int N;
unsigned long long int height[100000];
cin >> T;
for(i = 1; i <= T; i++) {
cin >> N;
for(int j = 0, k = N; j < N; j++) {
cin >> height[j];
height[j] = height[j] * k;
k–;
}
for(int l = 1; l < N; l++) {
if(height[0] < height[l]) {
height[0] = height[l];
}
}
printf(“Case %d: %llu\n”,i,height[0]);
}
return 0;
}