/*
很不错的递推题,一开始想着枚举,后来掂量了下肯定会TLE,然后分析各层之间的数据关系得到O(n)的算法:
数据结构: sum[i]: 1至i层租户的总数, num[i]: 第i层的租户数
updec[i]: i层至n层所有用户少走一层减少的不满意度, 通过数学推倒很容易发现 updec[i] = updec[i + 1] + a * num[i] + sum[m] - sum[i];
downincre[i]: 1至i层所有用户多走一层增加的不满意度,通过数学推倒很容易发现downincre[i] = downincre[i - 1] + b * num[i] + sum[i - 1];
score[1]:当电梯厅在第一层时的不满意度总和
以上数据均可在O(n)内预先算出
则设score[i]表示电梯停在第i层的不满意度总和(i >= 2)
怎 score[i] = score[i - 1] - updec[i] + downincre[i - 1];
则所求结果是min(score[i]), for i from 1 to m
注意要用__int64来计算
*/
#include <iostream>
#define MAX_F 10005
using namespace std;
__int64 sum[MAX_F + 1];
__int64 updec[MAX_F + 1];
__int64 downincre[MAX_F + 1];
int m, a, b;
int main()
{
int caseN, i;
scanf("%d", &caseN);
while(caseN--)
{
scanf("%d%d%d", &m, &a, &b);
__int64 curPN, curScore = 0;
sum[0] = 0;
for(i = 1; i <= m; i++)
{
scanf("%I64d", &curPN);
sum[i] = sum[i - 1] + curPN;
curScore += ((i - 1) * a + (i - 1) * (i - 2) / 2) * (sum[i] - sum[i -1]);
}
updec[m + 1] = downincre[0] = 0;
for(i = 1; i <= m; i++)
{
int upPos = m - i + 1;
updec[upPos] = updec[upPos + 1] + a * (sum[upPos] - sum[upPos - 1]) + sum[m] - sum[upPos];
downincre[i] = downincre[i - 1] + b * (sum[i] - sum[i - 1]) + sum[i - 1];
}
__int64 minScore = curScore;
int minPos = 1;
for(i = 2; i <= m; i++)
{
__int64 newScore = curScore - updec[i] + downincre[i - 1];
if(newScore < minScore)
{
minScore = newScore;
minPos = i;
}
curScore = newScore;
}
printf("%d/n", minPos);
}
return 0;
}
POJ 1701 Dissatisfying Lift
最新推荐文章于 2021-08-16 10:33:13 发布