제출 #496982

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
496982		vinnipuh01	Maxcomp (info1cup18_maxcomp)	C++17	0 / 100	1 ms	332 KiB

maxcomp

#include <iostream>
#include <bits/stdc++.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <string>
#include <map>
#include <queue>
#define int long long

using namespace std;

const long long oo = 1000000000000000000;

long long sum, ans = 0, mx = 0, mn = 1000000000, num, pos;


/*
    ViHHiPuh

   (( `'-""``""-'` ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / `;#'#'# - #'#'#;` \
 \_)) -----'#'----- ((_/
      # --------- #
  '# ------- ------ #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))


    cout << fixed << setprecision(6) << x;

    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    freopen ( "sum.in", "r", stdin )
*/

int mp[ 1001 ][ 1001 ];
int n, m, a[ 1001 ][ 1001 ], now[ 1001 ][ 1001 ];

int f( int x, int y ) {
	if ( !x || !y || x > n || y > m )
		return -1;
	if ( mp[ x ][ y ] != -2 )
		return mp[ x ][ y ];
	now[ x ][ y ] = 1;
	mx = max( mx, a[ x ][ y ] );
	mn = min( mn, a[ x ][ y ] );
	sum ++;
	int mxx = mx - mn - sum;
	if ( !now[ x + 1 ][ y ] )
		mxx = max( mxx, f( x + 1, y ) );
	if ( !now[ x ][ y - 1 ] )
		mxx = max( mxx, f( x, y - 1 ) );
	if ( !now[ x ][ y + 1 ] )
		mxx = max( mxx, f( x, y + 1 ) );
	if ( !now[ x - 1 ][ y ] )
		mxx = max( mxx, f( x - 1, y ) );
	now[ x ][ y ] = 0;
	return mp[ x ][ y ] = mxx;
}

main () {
	cin >> n >> m;
	for ( int i = 1; i <= n; i ++ ) {
		for ( int j = 1; j <= m; j ++ ) {
			cin >> a[ i ][ j ];
			mp[ i ][ j ] = -2;
		}
	}
	for ( int i = 1; i <= n; i ++ ) {
		for ( int j = 1; j <= m; j ++ ) {
			ans = max( ans, f( i, j ) );
		}
	}
	cout << ans;
}


/*
4
3 3 4

4 ^ 6 ^ 8 ^ 5 ^ 6 ^ 7 = 14

2 3
2 4 3
5 7 5

*/

컴파일 시 표준 에러 (stderr) 메시지

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

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