UVA 10465 - Homer Simpson
2011-12-05 22:15
309 查看
这道题要尽可能的多吃Krusty- burger,尽可能的少浪费时间,也是背包问题。
#include<stdio.h> #include<string.h> #define MAXT 10005 int a[2], t[MAXT], cnt[MAXT]; int T; void dp() { memset( t, 0, sizeof t); memset( cnt, 0, sizeof cnt); for( int i = 0; i < 2; i ++) for( int j = a[i]; j <= T; j ++) { if( t[ j - a[i] ] + a[i] > t[j]) { t[j] = t[ j - a[i]] + a[i]; cnt[j] = cnt[ j - a[i] ] + 1; } else if( t[j - a[i]] + a[i] == t[j] && cnt[j - a[i]] + 1 > cnt[j]) cnt[j] = cnt[j - a[i]] + 1; } } int main() { while( scanf( "%d%d%d", &a[0], &a[1], &T) == 3) { dp(); if( t[T] == T) printf( "%d\n", cnt[T]); else printf( "%d %d\n", cnt[T], T - t[T]); } return 0; }
相关文章推荐
- UVA 10465 - Homer Simpson 贪心或完全背包
- UVa 10465 - Homer Simpson 背包
- uva 10465 Homer Simpson
- uva 10465 - Homer Simpson(贪心)
- UVa 10465 - Homer Simpson 背包
- uva 10465 (Homer Simpson) (DP)
- UVA 10465 Homer Simpson(dp + 完全背包)
- UVA 10465 - Homer Simpson
- UVa 10465 Homer Simpson
- UVa 10465 Homer Simpson (枚举)
- UVa 10465 - Homer Simpson
- uva 10465 - Homer Simpson(贪心+完全背包)
- UVa 10465 - Homer Simpson(背包&贪心)
- UVA - 10465 Homer Simpson
- UVA 10465 - Homer Simpson
- [动态规划]UVA10465 - Homer Simpson
- UVa 10465 Homer Simpson(DP 完全背包)
- UVA 10465 Homer Simpson 完全背包
- UVA - 10465 Homer Simpson
- UVa 10465 Homer Simpson(DP 全然背包)