pku 3427 砍树.txt

来自「ACM资料大集合」· 文本 代码 · 共 50 行

#include <stdio.h>
#include <iostream>
#include <stdio.h>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <string.h>
#include <algorithm>

//PKU 3427 砍树
using namespace std;
#define NMAX 35000
#define INFI 9999999

int high[NMAX];

void solve(int len,int num)
{
	int i,j,ans,sum,anst;
	ans=INFI;
	for(i=0;i<len;i++)
	{
		sum=0;
		for(j=1;j<=num;j++)
		{
			sum+=high[j];
			high[j]=(high[j]+1)%len;
		}
		if(ans>sum) {ans=sum;anst=i;}
	}
	printf("%d\n",anst);
}

int main()
{
	int len,num,i;
	while(scanf("%d %d",&num,&len)!=EOF)
	{
		for(i=1;i<=num;i++) 
		{
			scanf("%d",&high[i]);
			high[i]=high[i]%len;
		}
		solve(len,num);
	}
	return 0;
}