摘要:
原题如下: Layout Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14484 Accepted: 6961 Description Like everyone else, cows like to stand close 阅读全文
摘要:
原题如下: Conscription Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16584 Accepted: 5764 Description Windy has a country, and he wants to bu 阅读全文
摘要:
原题如下: Roadblocks Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19314 Accepted: 6777 Description Bessie has moved to a small farm and some 阅读全文
摘要:
二分图判定 问题描述:给定一个具有n个顶点的图,要对图上每个顶点染色,并且要使相邻的顶点颜色不同,问是否能最多用2种颜色进行染色。题目保证没有重边和自环。 限制条件:1≤n≤1000 分析:科普:把相邻点染成不同颜色的问题叫做图着色问题。对图进行染色所需要的最小颜色称为最小着色数。最小着色数是2的图 阅读全文