1275 - Internet Service Providers
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 ≤ 109).
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与N,C间存在数学式T*(C-N*T),问当T取什么值(整数值)时能让这个数学式的值最大。(T取满足条件的最小值)。
题解:很明显,就是一个求一元二次方程最高点横坐标的问题。顶点坐标(-b/(2*a),(4*a*c-b*b)/(4*a))。要注意的地方是求出T后,是向下取整的,最大的整数最高点可能落在T+1上,这里需要比较一下。
代码如下:
#include<cstdio>
#include<cstring>
int main()
{
int t,k=1;
long long n,c,ans,max1,max2,cnt;
scanf("%d\n",&t);
while(t--)
{
scanf("%lld%lld",&n,&c);
if(!n||!c)
printf("Case %d: 0\n",k++,ans);
else
{
ans=c/(2*n);
max1=(-n*ans*ans)+c*ans;
cnt=ans+1;
max2=(-n*cnt*cnt)+c*cnt;
if(max1>=max2)//判断整数最高点落在那在哪个横坐标上
printf("Case %d: %lld\n",k++,ans);
else
printf("Case %d: %lld\n",k++,cnt);
}
}
return 0;
}