1431ms
将所有约束条件的边建立,然后spfa输出最大值与最小值之差
//#include <bits/stdc++.h>
#include <vector>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std ;
const int inf = 0x3f3f3f3f ;
const int maxn = 50005 ;
struct edge{
int u , v , w;
//bool mark ; /// train = 1 , road = 0
};
vector<int> g[maxn] ;
vector<edge> Edge ;
int inq[maxn] , dis[maxn];
//bool vis[maxm] ;
void addEdge(int u , int v , int w ){
edge e ;
e.u = u , e.v = v , e.w = w ;
Edge.push_back(e) ;
g[u].push_back(Edge.size() - 1) ;
/*e.v = u , e.u = v ;
Edge.push_back(e) ;
g[v].push_back(Edge.size() - 1) ;*/
}
void spfa(int u)
{
int i,k;
memset(dis , inf , sizeof(dis)) ;
memset(inq , 0 , sizeof(inq)) ;
dis[u] = 0 ; inq[u] = 1 ;
queue <int> q;
q.push(u);
while (! q.empty() ){
int t = q.front() ; q.pop() ;
inq[t] = 0 ;
for(k = 0 ; k < g[t].size() ; k ++){
edge e = Edge[ g[t][k] ];
if (dis[e.v] > dis[e.u] + e.w)
{
dis[e.v] = dis[e.u] + e.w;
//vis[ g[t][k] ] = 1 ;
if(! inq[e.v]){
inq[e.v] = 1 ;
q.push(e.v);
}
}
}
}
}
int main(){
int n , a , b , c ;
while( ~ scanf("%d" , &n)){
Edge.clear() ;
for(int i = 0 ; i <= 50000 ; i ++ )
g[i].clear() ;
int st = 50000 , ed = 0 ;
for(int i = 0 ; i < n ; i ++){
scanf("%d %d %d" , &a , &b , &c) ;
addEdge(b , a - 1 , -c) ;
st = min(st , a - 1) ;
ed = max(ed , b) ;
//cout << a - 1 << b << c << endl ;
}
for(int i = st ; i < ed ; i ++ ){
addEdge(i , i + 1 , 1) ;
addEdge(i + 1 , i , 0) ;
}
spfa(ed) ;
//cout << st << " " << ed << endl ;
/*for(int i = 0 ; i <= ed ; i ++ )
cout << dis[ed] << " " ;
cout << endl ;*/
printf("%d\n" , - dis[st]) ;
}
return 0 ;
}
/*
3 3 0
1 3 1
1 2 100
2 3 4
*/
340ms
只建立联系的边,对I 与 I + 1 的关系只进行判断,然后全部符合条件时返回正确
速度差异很明显,差了一个边的常数
//#include <bits/stdc++.h>
#include <vector>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std ;
const int inf = 0x3f3f3f3f ;
const int maxn = 50005 ;
struct edge{
int u , v , w;
//bool mark ; /// train = 1 , road = 0
};
//vector<int> g[maxn] ;
vector<edge> Edge ;
//int inq[maxn] ,
int dis[maxn];
//bool vis[maxm] ;
void addEdge(int u , int v , int w ){
edge e ;
e.u = u , e.v = v , e.w = w ;
Edge.push_back(e) ;
// g[u].push_back(Edge.size() - 1) ;
/*e.v = u , e.u = v ;
Edge.push_back(e) ;
g[v].push_back(Edge.size() - 1) ;*/
}
/*
void spfa(int u)
{
int i,k;
memset(dis , inf , sizeof(dis)) ;
memset(inq , 0 , sizeof(inq)) ;
dis[u] = 0 ; inq[u] = 1 ;
queue <int> q;
q.push(u);
while (! q.empty() ){
int t = q.front() ; q.pop() ;
inq[t] = 0 ;
for(k = 0 ; k < g[t].size() ; k ++){
edge e = Edge[ g[t][k] ];
if (dis[e.v] > dis[e.u] + e.w)
{
dis[e.v] = dis[e.u] + e.w;
//vis[ g[t][k] ] = 1 ;
if(! inq[e.v]){
inq[e.v] = 1 ;
q.push(e.v);
}
}
}
}
}*/
int check(int n , int st , int ed){
bool flag = true ;
edge e ;
while(flag){
flag = false ;
for(int i = 0 ; i < n ; i ++ ){
e = Edge[i] ;
if(dis[e.u] > dis[e.v] - e.w){
dis[e.u] = dis[e.v] - e.w ;
flag = true ;
}
}
for(int i = st ; i <= ed ; i ++ ){
if(dis[i] > dis[i-1] + 1){
dis[i] = dis[i - 1] + 1 ;
flag = true ;
}
if(dis[i - 1] > dis[i]){
dis[i - 1] = dis[i] ;
flag = true ;
}
}
}
}
int main(){
int n , a , b , c ;
while( ~ scanf("%d" , &n)){
Edge.clear() ;
//for(int i = 0 ; i <= 50000 ; i ++ )
// g[i].clear() ;
memset(dis , 0 , sizeof(dis)) ;
int st = 50000 , ed = 0 ;
for(int i = 0 ; i < n ; i ++){
scanf("%d %d %d" , &a , &b , &c) ;
addEdge(a - 1, b , c) ;
st = min(st , a - 1) ;
ed = max(ed , b) ;
//cout << a - 1 << b << c << endl ;
}
/*for(int i = st ; i < ed ; i ++ ){
addEdge(i , i + 1 , 1) ;
addEdge(i + 1 , i , 0) ;
}*/
//spfa(ed) ;
check(n , st , ed) ;
//cout << st << " " << ed << endl ;
/*for(int i = 0 ; i <= ed ; i ++ )
cout << dis[ed] << " " ;
cout << endl ;*/
printf("%d\n" , dis[ed] - dis[st - 1]) ;
}
return 0 ;
}
/*
3 3 0
1 3 1
1 2 100
2 3 4
*/