Submission #496791

#	Time	Username	Problem	Language	Result	Execution time	Memory
496791		Ierus	Maxcomp (info1cup18_maxcomp)	C++17	15 / 100	1 ms	204 KiB

maxcomp

#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
using namespace std;
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
#define F first
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef long long ll;
const int E = 1e6+777;
const long long inf = 1e18+777;
const int N = 1e3;
const int MOD = 1e9+7;
const bool I = 1;
int n, m, a[N][N];
int main(){
	cin >> n >> m;
	for(int i = 1; i <= n; ++i){
		for(int j = 1; j <= m; ++j){
			cin >> a[i][j];
		}
	}
	int res = 0;
	for(int i = 1; i <= m; ++i){
		int mn = INT_MAX, mx = INT_MIN;
		for(int j = i; j <= m; ++j){
			mn = min(mn, a[1][j]);
			mx = max(mx, a[1][j]);
			res = max(res, mx - mn - (j - i + 1));
		}
	}
	cout << res;
}

• Subtask 1: 0 / 15
• Subtask 2: 15 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40