View Code of Problem 61

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
using namespace std;
#pragma warning(disable:4996)


int main() {
	int n;
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		int m;
		int x[100];
		scanf("%d", &m);
		for (int i = 0; i < m; i++) {
			scanf("%d", &x[i]);			
		}
		int MAX = 0;
		for (int i = 0; i < m; i++) {
			int Max = 0;
			for (int j = i; j < m; j++) {
				int tp;
				int min = 999999;
				for (int h = i; h <= j; h++) {
					if (x[h] < min) {
						min = x[h];
					}
				}
				tp = (j - i + 1)*min;
				if (tp > Max) {
					Max = tp;
				}
			}
			if (Max > MAX) {
				MAX = Max;
			}
		}		
		printf("%d\n", MAX);
	}
	return 0;
}