usaco Score Inflation

hehe......

做这道题目时，第一想法是应该要用到时图论的什么算法，后来左想右想没能把图论经典算法中的某一种跟这道题扯上边来。后来竟在纸上写了个转移方程，呃，这不就成了动态规划了么？无语。。。。

score[i] = Max{score[j], score[i-j]}

代码如下：

/* 
ID: guo geer 
PROG: inflate 
LANG: C++ 
*/  

#include<fstream>
#include<iostream>
using namespace std;

const int MAX = 10001;
struct node
{
	int p;
	int m;
}con[MAX];

int main()
{
	ifstream fin("inflate.in");
	ofstream fout("inflate.out");

	int score[MAX];
	int m, n;
	while(fin>>m>>n)
	{
		int i,j,k;
		for(i=0; i<=m; i++)
			score[i] = 0;

		for(i=0; i<n; i++)
		{
			fin>>con[i].p>>con[i].m;
			score[con[i].m] = con[i].p;
		}

		for(i=0; i<=m; i++)
			for(j=0; j<=i; j++)
				if(score[j] + score[i-j] > score[i])
					score[i] = score[j] + score[i-j];

		fout<<score[m]<<endl;

	}
	return 0;
}