题意: 简单的说就是 给出m给 si 与sj的关系,其中sj的糖数不能比si的多c个,即sj-si <= c
最后求
flymouse(n)最多能比soonpy(1) 多多少糖,
思路:话说这是个差分约束问题 其实就是求最短路问题 只要求出dis[n]就行了 原先用 队列实现spfa 但超时了,因为是 每个点入队列超过30000 次 后改为栈实现 ps:有负环时,用栈比队列快,(原因是啥,我也不知道)
栈实现:
#include <stdio.h>
#include <string.h>
#define VM 30005
#define EM 150005
#define inf 0x3f
int head[VM],ep;
struct edge
{
int v,w,next;
}e[EM];
void addedge(int cu,int cv,int cw)
{
ep ++;
e[ep].v = cv;
e[ep].w = cw;
e[ep].next = head[cu];
head[cu] = ep;
}
void spfa (int n)
{
int vis[VM],stack[VM],dis[VM];
memset (vis,0,sizeof(vis));
memset (dis,0x3f,sizeof(dis));
dis[1] = 0;
vis[1] = 1;
int top = 1;
stack[0] = 1;
while (top)
{
int u = stack[--top];
vis[u] = 0;
for (int i = head[u];i != -1;i = e[i].next)
{
int v = e[i].v;
if (dis[v] > dis[u] + e[i].w)
{
dis[v] = dis[u] + e[i].w;
if (!vis[v])
{
vis[v] = 1;
stack[top++] = v;
}
}
}
}
printf ("%d\n",dis[n]);
}
int main ()
{
int n,m,v1,v2,cost;
ep = 0;
memset (head,-1,sizeof(head));
scanf ("%d%d",&n,&m);
while (m--)
{
scanf ("%d%d%d",&v1,&v2,&cost);
addedge (v1,v2,cost);
}
spfa (n);
return 0;
}
队列实现:
#include <stdio.h>
#include <string.h>
#define VM 300005
#define EM 1500005
#define inf 0x3f
int head[VM],ep;
struct edge
{
int v,w,next;
}e[EM];
void addedge(int cu,int cv,int cw)
{
ep ++;
e[ep].v = cv;
e[ep].w = cw;
e[ep].next = head[cu];
head[cu] = ep;
}
void spfa (int n)
{
int vis[VM],queue[VM],dis[VM];
memset (vis,0,sizeof(vis));
memset (dis,0x3f,sizeof(dis));
dis[1] = 0;
int front = -1,rear = 0;
queue[rear++] = 1;
vis[1] = 1;
while (front != rear)
{
front = (front+1)%(n+1);
int u = queue[front];
vis[u] = 0;
for (int i = head[u];i != -1;i = e[i].next)
{
if (dis[e[i].v] > dis[u]+e[i].w)
{
dis[e[i].v] = dis[u]+e[i].w;
if (!vis[e[i].v])
{
vis[e[i].v] = 1;
queue[rear] = e[i].v;
rear = (rear+1)%(n+1);
}
}
}
}
printf ("%d\n",dis[n]);
}
int main ()
{
int n,m,v1,v2,cost;
ep = 0;
memset (head,-1,sizeof(head));
scanf ("%d%d",&n,&m);
while (m--)
{
scanf ("%d%d%d",&v1,&v2,&cost);
addedge (v1,v2,cost);
}
spfa (n);
return 0;
}
思路:话说这是个差分约束问题 其实就是求最短路问题 只要求出dis[n]就行了 原先用 队列实现spfa 但超时了,因为是 每个点入队列超过30000 次 后改为栈实现 ps:有负环时,用栈比队列快,(原因是啥,我也不知道)
栈实现:
#include <stdio.h>
#include <string.h>
#define VM 30005
#define EM 150005
#define inf 0x3f
int head[VM],ep;
struct edge
{
}e[EM];
void addedge(int cu,int cv,int cw)
{
}
void spfa (int n)
{
}
int main ()
{
}
队列实现:
#include <stdio.h>
#include <string.h>
#define VM 300005
#define EM 1500005
#define inf 0x3f
int head[VM],ep;
struct edge
{
}e[EM];
void addedge(int cu,int cv,int cw)
{
}
void spfa (int n)
{
}
int main ()
{
}