ACM - UVA 108 - Maximum Sum

Problem: 108 - Maximum Sum
Solution: C++
Hints: http://www.algorithmist.com/index.php/UVa_108

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <utility>
#include <set>
#include <math.h>
using namespace std;

#define Dif(i,j,k) (Table[i+k][j] - Table[i][j])
#define MAXN 110

int N, MAX;
int Table[MAXN][MAXN];

void ReadCase()
 {
   int i, j;
   for(i = 1; i<=N; i++)
           for(j  = 0; j<N; j++)
                   scanf("%d",&Table[i][j]);         
}

void Cal()
{
   int i, j, k, t;
   for(i = 1; i<=N; i++)
   {
           for(j = 0; j<N; j++)
                  Table[i][j] =  Table[i][j] + Table[i-1][j];
   }

   MAX = Table[1][0];
   for(k = 1; k<=N; k++)
   {
           for(i = 0; i<=N-k; i++)
           {
                    for(t = 0, j = 0; j<N; j++)
                   {
                          if(t>=0)
                                  t+= Dif(i,j,k);
                          else
                                  t = Dif(i,j,k);
                          if(t>MAX)
                                  MAX = t;
                   }
           }
   }               
   printf("%d\n",MAX); 
}

void FREE()
{
   int i, j;
   for(i = 0; i<=N; i++)
           for(j = 0; j<=N; j++)
                   Table[i][j] = 0;
}

int main()
{
    int f = 0; 
        while(scanf("%d",&N) == 1)
        {
           if(f++)
                 FREE();
           ReadCase();
           Cal();         
        }
        return 0;
}
    

ACM - UVA 116 - Unidirectional TSP

Problem: 116 - Unidirectional TSP 
Solution: C++
Hints: http://www.algorithmist.com/index.php/UVa_116

ACM - UVA 458 - The Decoder

Problem : 458 - The Decoder
Solution : C++
Hints : http://algorithmist.com/index.php/UVa_458

ACM - UVA 305 - Joseph

Problem : 305 - Joseph
Solution : C++
Hints : http://algorithmist.com/index.php/UVa_305

ACM - UVA 113 - Power of Cryptography

Problem : 113 - Power of Cryptography
Solution : C++
Hints : http://algorithmist.com/index.php/UVa_113

ACM - UVA 111 - History Grading

Problem : 111 - History Grading
Solution : C++
Hints : http://algorithmist.com/index.php/UVa_111

ACM - UVA 202 - Repeating Decimals

Problem : 202 - Repeating Decimals
Solution : C++
Hints : http://algorithmist.com/index.php/UVa_202

ACM - UVA 167 - The Sultan's Successors

Problem : 167 - The Sultan's Successors
Soutioon : C++
Hints : http://algorithmist.com/index.php/UVa_167

ACM - UVA 200 - Rare Order

Problem: 200 - Rare Order
Solution: C++
Hints : http://algorithmist.com/index.php/UVa_200

ACM - UVA 154 - Recycling

Problem: 154 - Recycling
Solution: C++
Hints: http://algorithmist.com/index.php/UVa_154