摘要:
#include#define N 200char s[N];int judgeup(char c) { if(c>='A'&&c='a'&&c=2) { sum=sum+1+h; i=j-1; lock=1... 阅读全文
摘要:
#include//求出其所有的强连通分量缩点,选出出度和入度最大的那个就是要求的边#include#include#define N 51000struct node { int v,next;}bian[N];int head[N],yong,n,indegree[N],outdegree[N]... 阅读全文
摘要:
#include#include#define inf -9999999#define N 40int dp[N][1100];int ma[N][1100];int MAX(int a,int b) {return a>b?a:b;}int main() { int n,m,i,j,t,k; sc... 阅读全文
摘要:
#include#include#define N 110000struct node {int u,v,len,time;}ma[N];int cmp(const void *a,const void *b){return (*(struct node *)a).time-(*(struct no... 阅读全文