摘要:
0、目录 图的表示、图的搜索、图论知识点整理 1、图的表示 1.1、邻接矩阵 mat[u][v]表示从u到v边权为mat[u][v]。 1.2、邻接表 1.2.1、静态指针 //支持重边 struct Edge { int u, v, w,ne; Edge(int u, int v, int w, 阅读全文
摘要:
题目链接: "http://www.codeforces.com/contest/10/problem/D" D. LCIS time limit per test:1 secondmemory limit per test:256 megabytes 问题描述 This problem diffe 阅读全文
摘要:
题目链接: 题目 "Greatest Common Increasing Subsequence" Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) 问题描述 This is a prob 阅读全文
摘要:
题目链接: 题目 "A. Reberland Linguistics" time limit per test:1 second memory limit per test:256 megabytes 问题描述 First rate specialists graduate from Berland 阅读全文
摘要:
题目链接: 题目 "E. The Values You Can Make" time limit per test:2 seconds memory limit per test:256 megabytes 问题描述 Pari wants to buy an expensive chocolate 阅读全文
摘要:
题目链接: 题目 "D. Remainders Game" time limit per test 1 second memory limit per test 256 megabytes 问题描述 Today Pari and Arya are playing a game called Rema 阅读全文
摘要:
题目链接: 题目 "Underground Cables" Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu 问题描述 A city wants to get rid of their unsightly po 阅读全文