1: /*
2: problem: 路径问题
3: date: 4.20
4: */
5: #include <iostream>
6:
7: using namespace std;
8: int w[105][105] , ans[105][105] ;
9: int main()
10: {
11: int f,v;
12: cin>>f>>v;
13: for(int i=0;i<f;i++)
14: {
15: for(int j=0;j<v;j++)
16: {
17: cin>>w[i][j];
18: }
19: }
20: //
21: for(int i=0;i<v;i++) ans[0][i] = w[0][i] ;
22: for(int i=1;i<f;i++) // jie duan
23: {
24: for(int j=0;j<v;j++) // status
25: {
26: ans[i][j] = -100000000 ; //
27: for(int k=0;k<v;k++)
28: {
29: if(j>k) // jue ce
30: {
31: ans[i][j] = max(ans[i][j],ans[i-1][k]+w[i][j]);
32: }
33: }
34: //ans[i][j] =
35: }
36: }
37: int maxx = -1000000;
38: for(int i=0;i<v;i++)
39: {
40: maxx = max(maxx,ans[f-1][i]);
41: }
42: cout<<maxx ;
43: return 0;
44: }
posted on
