10.7 T2

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=99999999;
int n,Q,c[405],a[405][405],d[405][405];
int f[405][405],b[405];
int m,p[405][405];
struct node
{
    int x,y;
}t[405];
int cmp(const node n1,const node n2)
{
    return n1.x<n2.x；
}
int mx(int x,int y)
{
    return x>y?x:y;
}
int mn(int x,int y)
{
    return x<y?x:y;
}
int main()
{
freopen("cost.in","r",stdin);
freopen("cost.out","w",stdout);
int i,j,k;
 scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
 for(j=1;j<=n;j++)d[i][j]=maxn,f[i][j]=maxn;
 for(i=1;i<=n;i++)
 {
  scanf("%d",&t[i].x);t[i].y=i;
 }  
 sort(t+1,t+1+n,cmp);
for(i=1;i<=n;i++)b[t[i].y]=i,c[i]=t[i].x;
 int x,y,z;
 for(i=1;i<=m;i++)
 {
    scanf("%d%d%d",&x,&y,&z);
    x=b[x];y=b[y];
    a[x][y]=z;
    a[y][x]=z;

d[x][y]=d[y][x]=mn(d[x][y],z);
f[x][y]=f[y][x]=mn(d[x][y]+mx(c[x],c[y]),f[x][y]);
 }

/*for(i=1;i<=n;i++)
 for(j=1;j<=n;j++)
 if(a[i][j])d[i][j]=a[i][j],f[i][j]=d[i][j]+mx(c[i],c[j]);
 else d[i][j]=maxn,f[i][j]=maxn;*/

for(i=1;i<=n;i++)d[i][i]=f[i][j]=0;
int now;   

for(k=1;k<=n;k++)
 for(i=1;i<=n;i++)
 { 
  for(j=1;j<=n;j++)
  {

   if(i!=j&&j!=k&&k!=i&&d[k][j]!=maxn&&d[i][k]!=maxn)//+mx(mx(c[i],c[j]),c[k])<d[i][j])
   {
    d[i][j]=mn(d[i][k]+d[k][j],d[i][j]);//+mx(mx(c[i],c[j]),c[k]);
    f[i][j]=mn(mx(mx(c[i],c[j]),c[k])+d[i][j],f[i][j]);
    //now=mx(mx(p[i][k],c[i]),mx(mx(p[k][j],c[j]),c[k]));   
   } 
   //p[i][j]=now;
  }
 }

 int o,oo;
 scanf("%d",&Q);
 for(i=1;i<=Q;i++)
 {
    scanf("%d%d",&o,&oo);
    o=b[o];oo=b[oo];
    printf("%d\n",f[o][oo]);
 }

return 0;
}