OJ Board

Code: Select all

/* @JUDGE_ID: 48058YJ 108 C++ "" */

//@BEGIN_OF_SOURCE_CODE

#include <iostream>

using namespace std;

int main(void)
{
  int maxSum = 0;
  int maxSumTemp = 0;

  int n;
  do
  {
    cin >> n;
  }
  while(n <= 0);

  int array_2D[n][n];
  for(int i = 0; i < n; i++)
  {
    for(int j = 0; j < n; j++)
    {
      do
      {
        cin >> array_2D[i][j];
      }
      while((array_2D[i][j] < -127) || (array_2D[i][j] > 127));
    }
  }
  
  for(int i = 0; i < n; i++)
  {
    for(int j = i; j < n; j++)
    {
      for(int k = 0; k < n; k++)
      {
        for(int l = k; l < n; l++)
        {
          for(int x = i; x <= j; x++)
          {
            for(int y = k; y <= l; y++)
            {
              maxSumTemp += array_2D[x][y];
            }
          }
          maxSum = maxSumTemp > maxSum ? maxSumTemp : maxSum;
          maxSumTemp = 0;
        }
      }
    }
  }
  
  cout << maxSum << endl;

  return 0;
}

//@END_OF_SOURCE_CODE

Code: Select all

#include <iostream.h>
#include <limits.h>
/*
   <INPUT>
   N             N: positive integer, size of the square two dimentional array.
   .....            This is followed by N*N integers separated by white-space(row-major order)
   .....

   <OUTPUT>
   The output if the sum of the maximal sub-rectangle
   -
   <CONDITION>
   The sub-rectangle with the largest sum is referred to as the maximal sub-rectangle.
   A sub-rectangle is any contigious sub-array of size 1 X 1 or
   greater located within the while array.
   
   0 < N <= 100
   -127 <= elements <= +127
*/

void main()
{
	int   sub_max = INT_MIN, sub_cumulative = 0, total_cumulative = 0, total_max = INT_MIN;
	int   in_data, i, j, N;
	
	cin >> N;
	
	for (i = 0;   cin >> in_data;   j++)   {
	
		if ((sub_cumulative += in_data) > sub_max)
			sub_max = sub_cumulative;

		if (++i % N == 0)   {
			if ((total_cumulative += sub_max) > total_max)
				total_max = total_cumulative;
			
			sub_max = INT_MIN;
			sub_cumulative = 0;
			i = 0;
		}

	cout << total_max << endl;
}

Code: Select all

#include <iostream.h> 
#include <limits.h> 
/* 
   <INPUT> 
   N             N: positive integer, size of the square two dimentional array. 
   .....            This is followed by N*N integers separated by white-space(row-major order) 
   ..... 

   <OUTPUT> 
   The output if the sum of the maximal sub-rectangle 
   - 
   <CONDITION> 
   The sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. 
   A sub-rectangle is any contigious sub-array of size 1 X 1 or 
   greater located within the while array. 
    
   0 < N <= 100 
   -127 <= elements <= +127 
*/ 

void main() 
{ 
   int   sub_max = INT_MIN, sub_cumulative = 0, total_cumulative = 0, total_max = INT_MIN; 
   int   in_data, i, j, N; 
    
   cin >> N; 
    
   for (i = 0;   cin >> in_data;   j++)   { 
    
      if ((sub_cumulative += in_data) > sub_max) 
         sub_max = sub_cumulative; 

      if (++i % N == 0)   { 
         if ((total_cumulative += sub_max) > total_max) 
            total_max = total_cumulative; 
          
         sub_max = INT_MIN; 
         sub_cumulative = 0; 
         i = 0; 
      } 

   }

   cout << total_max << endl; 
} 

Code: Select all

void main()
{
	int   sub_max, sub_cumulative, total_cumulative, total_max;
	int   in_data, i, N, limits;
	
	while (cin >> N)   {

		/*   initialize...   */
		sub_max = INT_MIN, sub_cumulative = 0, total_cumulative = 0, total_max = INT_MIN;
		limits = N * N;
	
		for (i = 1;    i <= limits;    i++)   {
			
			cin >> in_data;
			if ((sub_cumulative += in_data) > sub_max)
				sub_max = sub_cumulative;

			if ((i % N) == 0)   {
				if ((total_cumulative += sub_max) > total_max)
					total_max = total_cumulative;
				
				sub_max = INT_MIN;
				sub_cumulative = 0;
			}
		}
		cout << total_max << endl;
	}   /*   end of while()   */
}

Code: Select all

4
-100 4 4 -100
-100 4 4 -100
-100 4 4 -100
-100 4 4 -100

Code: Select all

-92

Code: Select all

32

Code: Select all

#include <iostream.h>
#include <limits.h>

#define   ONLINE_JUDGE


void main()
{
	int   i = 0, N;
	int   in_data, sub_cumulative, sub_max;
	
	cin >> N;

	/*   first element must be include..   */
	cin >> sub_cumulative;
	sub_max = INT_MIN;
	

	i = 2;

	while (cin >> in_data)   {

		/*   ignore negative values  */
		sub_cumulative = (in_data > sub_cumulative + in_data) ? 
							((in_data > 0) ? 
								in_data : 
								sub_cumulative) : 
								((sub_cumulative + in_data > 0) ? 
									sub_cumulative + in_data :
									sub_cumulative);

		if (sub_cumulative > sub_max)
			sub_max = sub_cumulative;

		if ((i % N) == 0)   {
			sub_cumulative = sub_max;
			sub_max = INT_MIN;
		}
		
		i++;
		
	}   /*   end of while()   */

	cout << sub_cumulative << endl;
}