POJ 1976 A Mini Locomotive
来源:互联网 发布:sql包含某个字符 编辑:程序博客网 时间:2024/05/29 07:45
A Mini Locomotive
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions:2952 Accepted: 1597
Description
A train has a locomotive that pulls the train with its many passenger coaches. If the locomotive breaks down, there is no way to pull the train. Therefore, the office of railroads decided to distribute three mini locomotives to each station. A mini locomotive can pull only a few passenger coaches. If a locomotive breaks down, three mini locomotives cannot pull all passenger coaches. So, the office of railroads made a decision as follows:
1. Set the number of maximum passenger coaches a mini locomotive can pull, and a mini locomotive will not pull over the number. The number is same for all three locomotives.
2. With three mini locomotives, let them transport the maximum number of passengers to destination. The office already knew the number of passengers in each passenger coach, and no passengers are allowed to move between coaches.
3. Each mini locomotive pulls consecutive passenger coaches. Right after the locomotive, passenger coaches have numbers starting from 1.
For example, assume there are 7 passenger coaches, and one mini locomotive can pull a maximum of 2 passenger coaches. The number of passengers in the passenger coaches, in order from 1 to 7, is 35, 40, 50, 10, 30, 45, and 60.
If three mini locomotives pull passenger coaches 1-2, 3-4, and 6-7, they can transport 240 passengers. In this example, three mini locomotives cannot transport more than 240 passengers.
Given the number of passenger coaches, the number of passengers in each passenger coach, and the maximum number of passenger coaches which can be pulled by a mini locomotive, write a program to find the maximum number of passengers which can be transported by the three mini locomotives.
1. Set the number of maximum passenger coaches a mini locomotive can pull, and a mini locomotive will not pull over the number. The number is same for all three locomotives.
2. With three mini locomotives, let them transport the maximum number of passengers to destination. The office already knew the number of passengers in each passenger coach, and no passengers are allowed to move between coaches.
3. Each mini locomotive pulls consecutive passenger coaches. Right after the locomotive, passenger coaches have numbers starting from 1.
For example, assume there are 7 passenger coaches, and one mini locomotive can pull a maximum of 2 passenger coaches. The number of passengers in the passenger coaches, in order from 1 to 7, is 35, 40, 50, 10, 30, 45, and 60.
If three mini locomotives pull passenger coaches 1-2, 3-4, and 6-7, they can transport 240 passengers. In this example, three mini locomotives cannot transport more than 240 passengers.
Given the number of passenger coaches, the number of passengers in each passenger coach, and the maximum number of passenger coaches which can be pulled by a mini locomotive, write a program to find the maximum number of passengers which can be transported by the three mini locomotives.
Input
The first line of the input contains a single integer t (1 <= t <= 11), the number of test cases, followed by the input data for each test case. The input for each test case will be as follows:
The first line of the input file contains the number of passenger coaches, which will not exceed 50,000. The second line contains a list of space separated integers giving the number of passengers in each coach, such that the ith number of in this line is the number of passengers in coach i. No coach holds more than 100 passengers. The third line contains the maximum number of passenger coaches which can be pulled by a single mini locomotive. This number will not exceed 1/3 of the number of passenger coaches.
The first line of the input file contains the number of passenger coaches, which will not exceed 50,000. The second line contains a list of space separated integers giving the number of passengers in each coach, such that the ith number of in this line is the number of passengers in coach i. No coach holds more than 100 passengers. The third line contains the maximum number of passenger coaches which can be pulled by a single mini locomotive. This number will not exceed 1/3 of the number of passenger coaches.
Output
There should be one line per test case, containing the maximum number of passengers which can be transported by the three mini locomotives.
Sample Input
1735 40 50 10 30 45 602
Sample Output
240
This number will not exceed 1/3 of the number of passenger coaches. (这句话很关键)也就是说小火车头的数量是有限的,
因此最优解一定是将三个火车头全部装满。
转化为01背包问题,即把k个连续的车厢看成一个物品,一个可以装三个物品的背包所能装的最大价值;
- Source Code
#include<iostream>#include<algorithm>#include<string.h>#include<cstdio>int dp[4][50002]; using namespace std;int main(){int T; scanf_s("%d", &T);while (T--){memset(dp, 0, sizeof(dp));int a[50001];int n; scanf_s("%d", &n);for (int i = 1; i <= n; i++)scanf_s("%d", &a[i]);int co; scanf_s("%d", &co);int b[50001];a[0] = 0, b[0] = 0;for (int i = 1; i <= co; i++)b[i] = b[i - 1] + a[i];int sum = b[co];for (int i = co + 1; i <= n; i++){sum += a[i];sum -= a[i - co];b[i] = sum;} for (int i = 1; i <= 3; i++){for (int j = co; j <= n; j++){dp[i][j] = max(dp[i - 1][j - co] + b[j], dp[i][j - 1]);}}printf("%d\n", dp[3][n]);}return 0;}
阅读全文
0 0
- poj 1976 A Mini Locomotive
- POJ 1976 A Mini Locomotive
- POJ 1976 A Mini Locomotive
- POJ 1976 A Mini Locomotive
- POJ 1976 A Mini Locomotive
- poj 1976 A Mini Locomotive (DP)
- POJ 1976 A Mini Locomotive(背包)
- poj 1976 A Mini Locomotive(二维dp)
- poj 1976 A Mini Locomotive(01背包)
- POJ 1976 A Mini Locomotive DP
- poj 1976 A Mini Locomotive 01背包
- poj 1976 A Mini Locomotive 二维背包
- poj 1976 A Mini Locomotive(01背包)
- POJ 1976 A Mini Locomotive (动态规划)
- poj 1976 A Mini Locomotive (dp 二维01背包)
- poj 1976 A Mini Locomotive(0/1背包)
- poj 1976 A Mini Locomotive 有依赖的背包问题
- poj-1976 A Mini Locomotive(DP,记忆化搜索)
- erlang 进程独占的可能性
- 数据库第二天
- spring-data-JPA使用JpaRepository注解自定义SQL查询数据库多表查询
- H5——webSocket
- Java案例-用户注册邮箱验证将邮箱激活码存入redis功能实现
- POJ 1976 A Mini Locomotive
- 字典树
- NSData所有API学习
- Triple
- 10.6、spring boot的web应用——@ModelAttribute应用
- 深入解析Java垃圾回收机制
- Monkey使用和APP报名查看
- 求特殊自然数
- 数据结构实验之排序七:选课名单