zhousilijames的专栏

#include #include#includeusing namespace std;struct node{ int w,s;}cow[50005];int n,sum[50005];int qrt(node f,node se){ return f.s+f.w<se.s+se.w;}int main(){ while(scanf("%d",&

Problem DescriptionYou have a connected directed graph.Let d(x) be the length of the shortest path from 1 to x.Specially d(1)=0.A graph is good if there exist x satisfy d(1)d(2)....d(x)>d(x+1)>...d(n)