Search found 1 match

by kalachan
Tue Dec 25, 2007 4:44 pm
Forum: Volume 1 (100-199)
Topic: 108 - Maximum Sum
Replies: 233
Views: 52454

WA in Prob 108

#include<iostream>
using namespace std;

int size;
int M[100][100];
long long partialSum[100][100];

int main()
{

cin >> size;

for (int i = 0; i < size; i ++)
for (int j = 0; j < size; j ++)
cin >> M[i][j];


if (size <= 0)
{
cout << 0 << endl;
return 0;
}

long long MaxSum ...

Go to advanced search