28 lines
494 B
C
28 lines
494 B
C
#include "solve.h"
|
|
#include <math.h>
|
|
|
|
#define eps 1e-9
|
|
|
|
int compare(const double a, const double b)
|
|
{
|
|
if (a - b > eps) return 1;
|
|
else if (b - a > eps) return -1;
|
|
return 0;
|
|
}
|
|
|
|
double t2_solve(double *a, int n, int m)
|
|
{
|
|
int i, j;
|
|
double cur = 0, maximum = 0;
|
|
if (m > 0)
|
|
for (i = 0; i < n; i++) maximum += fabs(a[i * m]);
|
|
for (j = 1; j < m; j++)
|
|
{
|
|
cur = 0;
|
|
for (i = 0; i < n; i++)
|
|
cur += fabs(a[i * m + j]);
|
|
if (compare(cur, maximum) == 1) maximum = cur;
|
|
}
|
|
|
|
return maximum;
|
|
}
|