摘要:
#include using namespace std; int main(){ int l=1,r=n+1,mid,k; while (l+1>1; if (solve(mid)<=k) l=mid; else r=mid; } printf("%d",l); return 0; } 阅读全文
摘要:
#include using namespace std; const int P=1000000007; struct nob{ int to,jump,val,cost; }a[500000]; int n,m,s,t,tot=1,jump[500000]={0}; int len[10005],line[1000005]; bool judge[10005]; inline int... 阅读全文
摘要:
#include<bits/stdc++.h> using namespace std; struct edge{ int sta,ed,val,jump; }a[1000005]; int n,m,jump[1000005],tot,line[1000005],point[1000005],jud 阅读全文