1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
| #include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <time.h>
void setArray(int** mass, int rows, int cols)
{
int i, j;
srand(time(NULL));
for (i = 0; i < rows; i++)
for (j = 0; j < cols; j++)
mass[i][j] = rand() % 10;
}
int sumWithin(int** mass, int rows, int colStart, int colEnd)
{
int i, j, s = 0;
for (i = 0; i < rows; i++)
for (j = colStart; j < colEnd; j++)
s += mass[i][j];
return s;
}
void getResult(int**res, int** mass, int rows, int cols, int colStart, int width)
{
int i, j, k;
for (i = 0; i < rows; i++)
for (j = 0, k = 0; j < cols; j++)
if (j < colStart || j > colStart + width - 1)
{
res[i][k] = mass[i][j];
k++;
}
}
void showArray(int** mass, int rows, int cols)
{
int i, j;
for (i = 0; i < rows; i++)
{
for (j = 0; j < cols; j++)
printf(" %d", mass[i][j]);
printf("\n");
}
}
int main()
{
int m, n, k, i, s, cur;
int** matrix;
printf("m = ");
scanf(" %d", &m);
printf("n = ");
scanf(" %d", &n);
do
{
printf("(k<n) k = ");
scanf(" %d", &k);
} while (k >= n);
matrix = (int**) malloc(m * sizeof(int*));
for (i = 0; i < m; i++)
matrix[i] = (int*) malloc(n * sizeof(int));
setArray(matrix, m, n);
int max = INT_MIN, maxPos;
for (s = 0; s < n - k + 1; s++)
{
cur = sumWithin(matrix, m, s, k + s);
if (cur > max)
{
max = cur;
maxPos = s;
}
}
int** result =(int**) malloc(m * sizeof(int*));
for (i = 0; i < m; i++)
result[i] = (int*)malloc((n - k) * sizeof(int));
getResult(result, matrix, m, n, maxPos, k);
puts("\n Massiv:");
showArray(matrix, m, n);
printf("Max summa: %d \n", max);
puts("\n\nMassiv posle udalenia:");
showArray(result, m, n - k);
for (i = 0; i < m; i++)
free(matrix[i]);
free(matrix);
for (i = 0; i < m; i++)
free(result[i]);
free(result);
system("PAUSE");
return EXIT_SUCCESS;
} |
(
