洛谷P2911 [USACO08OCT]Bovine Bones G经典解法

#include<stdio.h>
#include<stdlib.h>
int main(void)
{
	int s1, s2, s3, i, j, k, m, n;
	scanf("%d%d%d", &s1, &s2, &s3);
	int* p = (int*)calloc(s1 + s2 + s3+3, sizeof(int));
	for (i = 1; i <= s1; i++)
	{
		for (j = 1; j <= s2; j++)
		{
			for (k = 1; k <= s3; k++)
			{
				(*(p+i+j+k))++;
			}
		}
	}
	m = *(p+3);
	n = 3;
	for (i = 3; i <=3+s1+s2+s3; i++)
	{
		if (*(p + i) > m)
		{
			m = *(p + i);
			n = i;
		}
	}
	printf("%d", n);
	return(0);
}