摘要：
思路：直接用优先队列优化bfs。#include#include#include#include#include#include#include#include#include#define Maxn 100010#define inf 1 g;int ans,n,ha[255],Exp[15];char s[13];int tar;struct QT{ int val,st; int operator temp.st; }};priority_queue q;int bfs(int temp){ int i,j,str; while(!q.empty()) q.... 阅读全文
