问题描述
代码实现
#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h>
#include <stdlib.h>
int main()
{
int a, b = 0;
scanf("%d %d", &a, &b);
int* parr = (int*)calloc(b, 4);
int* parr2 = (int*)calloc(a, 4);
int* ret = parr;
int* rret = parr;
if (parr == NULL)
{
return 1;
}
if (parr2 == NULL)
{
return 1;
}
int* ret2 = parr2;
int count = 0;
while (1)//输入数据
{
scanf("%d", ret2+ count);
count++;
if (count == a)
{
break;
}
}
int uint = 1;
int j = 0;
int m = 0;
int ci = 0;
while (1)//第一次循环 将parr初始化 构造 f(i)
{
for (m = 0; m < a; m++)
{
*(ret + *(ret2)) = uint;
int* mid = (ret + *(ret2));
for (j = 0; j < (b - *(ret2)-1); j++)
{
mid++;
*mid = uint;
}
ci++;
if (ci == a)
{
break;
}
ret2++;
uint++;
ret = rret;
}
break;
}
int r = b / (a + 1);
m = 0;
int* parr3 = (int*)calloc(b, 4);
if (parr3 == NULL)
{
return 1;
}
int* ret3 = parr3;
int* rret3 = parr3;
int thiscount = 0;
for (m = 0; m < b; m++)//第三次循环 构造g(i)
{
thiscount = m / r;
*(ret3+m)=thiscount;
}
m = 0;
thiscount = 0;
int* parr4 = (int*)calloc(b, 4);
if (parr4 == NULL)
{
return 1;
}
int* ret4 = parr4;
int* rret4 = parr4;
for (m = 0; m < b; m++)//构造差值
{
if (*(rret3 + m) > *(rret + m))
{
thiscount = (*(rret3 + m) - *(rret + m));
*(ret4 + m) = thiscount;
}
else
{
thiscount = (*(rret+m) - *(rret3 + m));
*(ret4 + m) = thiscount;
}
}
m = 0;
int sum = 0;
for (m = 0; m < b; m++)//计算 和
{
sum += *(rret4 + m);
}
printf("%d", sum);
free(parr);
free(parr2);
free(parr3);
free(parr4);
ret = NULL;
ret2 = NULL;
ret3 = NULL;
ret4 = NULL;
rret = NULL;
rret3 = NULL;
rret4 = NULL;
return 0;
}
二.总结及解释
对于f(i)的构造可以查阅我的上一篇CSDN
https://blog.csdn.net/m0_63780911/article/details/127053572
此处对于f(i)的构造给出了解释,本题除此之外多了一次g(i)的构造。
其实向下取整就是整形除法。
一定要注意的是,在构造差值的绝对值时,一定要注意是绝对值,所以多了一次大小判断。
除此之外本题其他部分较为简单。