Submission #403509

#	Time	Username	Problem	Language	Result	Execution time	Memory
403509		NurstanDuisengaliev	3D Histogram (COCI20_histogram)	C++14	20 / 110	2566 ms	3396 KiB

histogram

// Nurstan Duisengaliev(REALBOY)
// Respa Gold_2022
// IZHO GOLD_2022
// IOI_2022 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("O3")*/                   
      
#include <bits/stdc++.h>
 
#define ll long long
#define all(x) x.begin(), x.end()
#define in insert
#define mp make_pair
#define F first
#define S second
#define ppf pop_front
#define pb push_back
#define ppb pop_back
#define pf push_front
#define pii pair <int, int>
#define pll pair <ll, ll>
#define boost() ios_base::sync_with_stdio(0), cin.tie(0)
#define sz(x) (int)x.size()
 
using namespace std;
 
const int N = (int)2e5 + 123;
const int mod = (int)1e9 + 7;
const ll INF = (ll)1e18 + 1;
int n;
ll a[N], b[N]; 
void solve () {
	cin >> n;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i] >> b[i];
	}
	ll ans = 0;
	for (int i = 1; i <= n; i ++) {
		ll mini1 = mod, mini2 = mod;
		for (int j = i; j >= 1; j --) {
			mini1 = min (mini1, a[j]);
			mini2 = min (mini2, b[j]);
			ans = max (ans, mini1 * mini2 * (i - j + 1));	
		}
	}	
	cout << ans;
}   	
 
main () {
//	freopen (".in", "r", stdin);
//	freopen (".out", "w", stdout);
	boost ();
	int TT = 1;
//    cin >> TT;
	while (TT --) {
		solve ();
	}
	return 0;	                                    
}

Compilation message (stderr)

histogram.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main () {
      | ^~~~

• Subtask 1: 20 / 20
• Subtask 2: 0 / 90