#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
using namespace std;
const int N=300;
int n,a,b,k,t,ans;
int ins[N],vis[N][N];
struct node{
int x,val,t;
node() {}
node(int a, int b, int c): x(a), val(b), t(c) {}
};
void bfs()
{
queue<node> v;
node tmp;
int i,px,pv,pt;
v.push( node(0,ins[0],0) );
while(!v.empty())
{
tmp=v.front(); v.pop();
if(tmp.x>=n || tmp.t==k){
ans=max(tmp.val,ans);
continue;
}
for(i=......
阅读全文