递推法 人人为我型
状态result[ i ] 定义为开到第i个餐馆能获得的最大利润
#include <iostream>
#include <memory.h>
#define MaxLen 105
using namespace std;
int result[MaxLen];
int pos[MaxLen];
int pro[MaxLen];
int dp(int n)
{
}
int main()
{
int kase;
cin >> kase;
while( kase-- )
{
int num,k;
cin >> num >> k;
memset( result, 0, sizeof(result) );
memset( pos, 0, sizeof(pos) );
memset( pro, 0, sizeof(pro) );
for( int i = 0; i < num; i++ )
{
cin >> pos[i];
}
for( int i = 0; i < num; i++ )
{
cin >> pro[i];
result[i] = pro[i];
}
for( int i = 1; i < num; i++ )
{
int temp = 0;
for( int j = 0; j <&#