HDU 1712 ACboy needs your help (分組揹包)

#include <stdio.h>
#define MAX 101

int numOfCourses, mostDays;
int profit[MAX][MAX];
int maxProfit[MAX];

int main(){
	
	while (scanf("%d%d", &numOfCourses, &mostDays) != EOF){
		if (numOfCourses == 0 && mostDays == 0)
			break;

		int course, days;
		for (course = 1; course <= numOfCourses; course++)
			for (days = 1; days <= mostDays; days++)
				scanf("%d", &profit[course][days]);

		int totalDays;
		for (totalDays = 1; totalDays <= mostDays; totalDays++)
			maxProfit[totalDays] = 0;

		int preCourses, tempProfit;
		for (preCourses = 1; preCourses <= numOfCourses; preCourses++)
			for (totalDays = mostDays; totalDays >= 1; totalDays--)
				for (days = 1; days <= totalDays; days++){
					tempProfit = maxProfit[totalDays - days] + profit[preCourses][days];
					if (tempProfit > maxProfit[totalDays])
						maxProfit[totalDays] = tempProfit;
				}
				
		printf("%d\n", maxProfit[mostDays]);
	}

	return 0;
}

發佈了187 篇原創文章 · 獲贊 0 · 訪問量 5萬+
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章