UVa 242 Stamps and Envelope Size
2015-06-05 22:41
417 查看
Stamps and Envelope Size |
![](https://uva.onlinejudge.org/external/2/242img1.gif)
Input
The first line of each data set contains the integer S, representing the maximum of stamps that an envelope can accommodate. The second line contains the integer N, representing thenumber of sets of stamp denominations in the data set. Each of the next N lines contains a set of stamp denominations. The first integer on each line is the number of denominations in the set, followed by a list of stamp denominations, in order fromsmallest to largest, with each denomination separated from the others by one or more spaces. There will be at most S denominations on each of the N lines. The maximum value of S is 10, the largest stamp denomination is 100, the maximumvalue of N is 10.The input is terminated by a data set beginning with zero (S is zero).Output
Output one line for each data set giving the maximal no-gap coverage followed by the stamp denominations that yield that coverage in the following format:max coverage = <value> : <denominations>If more than one set of denominations in a set yields the same maximal no-gap coverage, the set with the fewest number of denominations should be printed (this saves on stamp printing costs). If two setswith the same number of denominations yield the same maximal no-gap coverage, then the set with the lower maximum stamp denomination should be printed. For example, if five stamps fit on an envelope, then stamp sets of 1, 4, 12, 21 and 1, 5, 12, 28 both yieldmaximal no-gap coverage of 71 cents. The first set would be printed because both sets have the same number of denominations but the first set's largest denomination (21) is lower than that of the second set (28). If multiple sets in a sequence yield the samemaximal no-gap coverage, have the same number of denominations, and have equal largest denominations, then print the set with the lewer second-maximum stamp denomination, and so on.Sample Input
5 2 4 1 4 12 21 4 1 5 12 28 10 2 5 1 7 16 31 88 5 1 15 52 67 99 6 2 3 1 5 8 4 1 5 7 8 0
Sample Output
max coverage = 71 : 1 4 12 21 max coverage = 409 : 1 7 16 31 88 max coverage = 48 : 1 5 7 8
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;// record[i][j][k]代表是否可以用第i,i+1,...,n面额邮票,在不超过j张情况下,得到总额为kint record[15][15][1100];// d[i]表示凑出面值i需要的邮票数量int d[15][1100];// 面额组合情况结构体typedef struct node{int stamp[15]; // 邮票面额int num; // 邮票张数int max_cov; // 能形成的最大覆盖bool operator < (const struct node& x) const{if(max_cov > x.max_cov)return true;else if(max_cov == x.max_cov){if(num < x.num)return true;else if(num == x.num){for(int i = num-1; i >= 0; i--){if(stamp[i] > x.stamp[i])return false;else if(stamp[i] < x.stamp[i])return true;}}elsereturn false;}elsereturn false;}}node;// 面额情况数组node array[15];// 最多能用的邮票张数int max_num;// 面额情况个数int array_len;// 代表现在需计算的是array[t]int t;int get_result(int i, int j, int k);int main(){while(scanf("%d", &max_num) == 1 && (max_num != 0)){scanf("%d", &array_len);// memset(d, -1, sizeof(d));// 读入所有情况for(t = 0; t < array_len; t++){memset(record, -1, sizeof(record));// memset(d, -1, sizeof(d));scanf("%d", &array[t].num);/* for(int j = 1; j <= array[t].num; j++)scanf("%d", &array[t].stamp[j]);*/for(int j = 0; j < array[t].num; j++)scanf("%d", &array[t].stamp[j]);// 计算结果int i = 0;// d[t][0] = 0;for(i = 1; ; i++){if(!get_result(0, max_num, i))break;/*if(d[t][i] == -1 || d[t][i] > max_num)break;// 更新其他的状态for(int j = 0; j < array[t].num; j++){if(i+array[i].stamp[j] >= 1100)continue;if(d[t][i+array[t].stamp[j]] == -1)d[t][i+array[t].stamp[j]] = d[t][i] + 1;else if(d[t][i+array[t].stamp[j]] > d[t][i] + 1)d[t][i+array[t].stamp[j]] = d[t][i] + 1;}*/ }array[t].max_cov = i-1;}/*sort(array, array+array_len);printf("max coverage =%4d :", array[0].max_cov);for(int i = 0; i < array[0].num; i++)printf("%3d", array[0].stamp[i]);printf("\n");*/// int max_c = array[0].max_cov;int place = 0;for(int i = 1; i < array_len; i++){if(array[i] < array[place])place = i;}printf("max coverage =%4d :", array[place].max_cov);for(int i = 0; i < array[place].num; i++)printf("%3d", array[place].stamp[i]);printf("\n");}return 0;}// 计算record[i][j][k]代表是否可以用第i,i+1,...,n面额邮票,在不超过j张情况下,得到总额为kint get_result(int i, int j, int k){if(record[i][j][k] != -1)return record[i][j][k];// 如果总额为0if(k == 0){record[i][j][k] = 1;return record[i][j][k];}// 如果只有一种面额可用if(i == array[t].num -1){if(k % array[t].stamp[i] == 0 && k / array[t].stamp[i] <= j)record[i][j][k] = 1;elserecord[i][j][k] = 0;return record[i][j][k];}// 如果只有一张邮票可用if(j == 1){for(int a = i; a < array[t].num; a++){if(array[t].stamp[a] == k){record[i][j][k] = 1;return record[i][j][k];}}record[i][j][k] = 0;return record[i][j][k];}// 如果没有邮票可用if(j == 0){record[i][j][k] = 0;return record[i][j][k];}// 否则,实验用第i种面额的所有情况int ans = 0;for(int use = 0; use <= j; use++){if(k-array[t].stamp[i]*use < 0)break;int r = get_result(i+1, j-use, k-array[t].stamp[i]*use);if(r == 1){ans = 1;break;}}record[i][j][k] = ans;return record[i][j][k];}/*max coverage = 71 : 1 4 12 21max coverage = 409 : 1 7 16 31 88max coverage = 48 : 1 5 7 8max coverage = 71 : 1 4 12 21 max coverage = 409 : 1 7 16 31 88 max coverage = 48 : 1 5 7 8max coverage = 71 : 1 4 12 21 max coverage = 409 : 1 7 16 31 88 max coverage = 48 : 1 5 7 8max coverage = 71 : 1 4 12 21 max coverage = 409 : 1 7 16 31 88 max coverage = 48 : 1 5 7 8*/
这题本身不难,不知为什么使用sort函数会runtime error, 不使用就可以AC. 以后再看
相关文章推荐
- Centos 6x安装sys-log
- 『初学opencv』——求灰度图像灰度直方图
- linux yum命令详解以及查询当前哪些包需要更新,与更新命令。
- Linux常用命令-文件处理命令-链接命令
- Tomcat使用
- Linux用户管理(1)
- Linux最常用的20条命令
- linux内存管理源码分析 - 概述
- OpenSessionInViewFilter的配置
- 设置linux静态IP
- Linux 压缩与解压缩相关
- MacOS copy图标shell脚本
- Linux Page Cache机制
- Hadoop文件解压缩
- Linux终端下的命令
- [GUI] Linux中的图形管理
- CentOS 创建svn服务器
- Tomcat服务器自动加载监听程序(转载)
- Win7+CentOS 7双系统启动顺序修改方法.
- Win7+CentOS 7双系统启动顺序修改方法.