染色问题,每次沿边染max,注意最后如果颜色数超过k,则可以按(k+1)-k-…-1的简单路径#include<bits/stdc++.h> using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define ForkD(i,k,n) for(in
B. Fox And Two Dotstime limit per test2 secondsmemory limit per test256 megabyte
A. DZY Loves Physicstime limit per test1 secondmemory limit per test256 megabytesi
求割点入门题!……死调一下午+晚上才发现把‘node'打成’nodes'了……Program P1523;const maxedge=999000; maxn=10000;var edge,tail:array[1..maxedge] of longint; size:longint; head:array[1..maxn] of longint;
Bellman_fordProgram P1860;var n,m,i,j,s:longint; v:double; flag:boolean; d:array[1..100] of double; x,y:array[1..100] of longint; map:array[1..100,1..4] of double;procedure r
拓排+各种判……Program P1094;type map3=record indegree:array['A'..'Z'] of longint; map:array['A'..'Z',1..26] of char; outdegree:array['A'..'Z'] of longint; end;var
给定一个有向图,问这是不是树?各种判……出现2条相同的边不是树,自己指向自己不是树,除根节点入度为0外其它点入度必须为1,森林,环都不是树……program P1308;const maxn=15;Var i,j:longint; b:array[1..maxn,1..maxn] of boolean; indegree:array[1..maxn]
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号