Dijkstra（优先队列）

题目链接：http://codeforces.com/problemset/problem/938/D

思路：原本Dijkstra没优化复杂度是O（n*n），肯定超时，要用优先队列优化一下，Dijkstra求的是单源最短路，可以建一个超级原点，那么d数组存的就是答案了。

Dijkstra：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%I64d",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod int(1e9+7)
#define lc (d<<1)
#define rc (d<<1|1)
#define P pair<int,int>
#define pi acos(-1)
struct as{
int x;
ll v;};
ll d[200008];
vector<as>g[200008];
int n,m;
void djk(int s)
{
    priority_queue<P,vector<P>,greater<P>> q;
    REW(d,inff);
    d[s]=0;
    q.push(P(0,s));
    while(q.size())
    {
        P p=q.top();q.pop();
        int v=p.second;
        if(d[v]<p.first)  continue;
        int ss=g[v].size();
        FOR(i,0,ss-1)
        {
            as e=g[v][i];
            if(d[e.x]>d[v]+e.v)
            {
                d[e.x]=d[v]+e.v;
                q.push(P(d[e.x],e.x));
            }
        }
    }
}
int main()
{
    cin.tie(0);
    si(n),si(m);
    while(m--)
    {
        int a,b;
        ll c;
        si(a),si(b),sl(c);
        g[a].push_back(as{b,2*c});
        g[b].push_back(as{a,2*c});
    }
    FOR(i,1,n)
    {
        ll c;
        sl(c);
        g[0].push_back(as{i,c});
    }
    djk(0);
    cout<<d[1];
    FOR(i,2,n)
    {
        cout<<" "<<d[i];
    }
    cout<<endl;
    return 0;
}

Dijkstra（优先队列）可以看看这篇博文，感觉代码比较简洁一点：http://blog.csdn.net/tlonline/article/details/47398403