Light OJ： 1275 - Internet Service Providers【数学】

1275 - Internet Service Providers

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

A group of N Internet Service Provider companies (ISPs) use a private communication channel that has a maximum capacity of C traffic units per second. Each company transfers T traffic units per second through the channel and gets a profit that is directly proportional to the factor T(C - T*N). The problem is to compute the smallest value of T that maximizes the total profit the N ISPs can get from using the channel. Notice that N, C, T, and the optimal T are integer numbers.

Input

Input starts with an integer T (≤ 20), denoting the number of test cases.

Each case starts with a line containing two integers N and C (0 ≤ N, C ≤ 10⁹).

Output

For each case, print the case number and the minimum possible value of T that maximizes the total profit. The result should be an integer.

Sample Input	Output for Sample Input
6 1 0 0 1 4 3 2 8 3 27 25 1000000000	Case 1: 0 Case 2: 0 Case 3: 0 Case 4: 2 Case 5: 4 Case 6: 20000000

 题意：给出n,c,求出使T*(c-n*T)最大的T的最小值。。。。。求导。。因为T是整数，比较对称轴两边的整数即可。。。

AC-code:

#include<cstdio>
int main()
{
	int T,i;
	long long t,x1,x2,n,c;
	scanf("%d",&T);
	for(i=1;i<=T;i++)
	{
		scanf("%lld%lld",&n,&c);
		if(!n||!c)
		{
			printf("Case %d: 0\n",i);
			continue;
		}
		t=c/2/n;
		x1=t*(c-n*t);
		x2=(t+1)*(c-n*(t+1));
		if(x1>=x2)
			t=t;
		else
			t=t+1;
		printf("Case %d: %lld\n",i,t);
	}
	return 0;
}