4823091_ac_141ms_280k.cpp

部分PKU上的源码

#include<iostream>
using namespace std;
int n,t;
int yt;
int yuan[27];
int fi[27];
int di[27];
int time[27];
int diao[27];
int best[27];
int tmax;
int main()
{
	int i,j;
	while(cin>>n)
	{
		if(n==0) return 0;
		cin>>yt;
		yt*=12;
		for(i=0;i<n;i++)cin>>yuan[i];
		for(i=0;i<n;i++)cin>>di[i];
		for(i=0;i<n-1;i++)cin>>time[i];
		tmax=-1;
		for(i=0;i<n;i++)
		{
			t=yt;
			memset(diao,0,sizeof(diao));
			int sum=0,re; 
			for(j=0;j<n;j++) fi[j]=yuan[j];
			for(j=0;j<i;j++) t-=time[j];
			while(t>0)
			{
				int temp=0;
				re=-1;
				for(j=0;j<=i;j++)
				{
					if(fi[j]>temp) {temp=fi[j];re=j;}
				}
				if(re==-1) break;//e
				diao[re]++;
				sum+=fi[re];
				fi[re]-=di[re];
				if(fi[re]<0) fi[re]=0;
				t--;
			}
			if(re==-1) diao[0]+=t;
			if(sum>tmax) //yiwen
			{
				for(j=0;j<n;j++) best[j]=diao[j];
				tmax=sum;
			}
		}
		for(j=0;j<n;j++) {if(j!=0)cout<<", ";cout<<best[j]*5;}
		cout<<endl;
		cout<<"Number of fish expected: "<<tmax<<endl<<endl;

	}
	return 0;
}