poj2411 Mondriaan's Dream[状压dp]

Mondriaan's DreamTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 16265 Accepted: 9413DescriptionSquares and re
5次阅读

poj2396 Budget&&ZOJ1994 Budget[有源汇上下界可行流]

BudgetTime Limit: 5 Seconds      Memory Limit: 32768 KB      Special JudgeWe are supposed
2次阅读

poj3233 Matrix Power Series

Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 22265 Accepted: 9334DescriptionGiven a&nbs
3次阅读

POJ1811 Prime Test

本文版权归ljh2000和博客园共有,欢迎转载,但须保留此声明,并给出原文链接,谢谢合作。  本文作者:ljh2000 作者博客:http://www.cnblogs.com/ljh2000-jump/转载请注明出处,侵权必究,保留最终解释权! 题目链接:POJ1811
6次阅读

SPOJ OPTM - Optimal Marks

OPTM - Optimal Marksno tags   You are given an undirected graph G(V, E). Each vertex has a mark which is an integer from the range [0..
3次阅读

poj3469 Dual Core CPU

Dual Core CPUTime Limit: 15000MS Memory Limit: 131072KTotal Submissions: 24092 Accepted: 10462Case Time Limit: 5000
2次阅读

poj3243 Clever Y[扩展BSGS]

Clever YTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 8666 Accepted: 2155DescriptionLittle Y finds there is
2次阅读

poj3693 Maximum repetition substring

 Maximum repetition substringTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9757 Accepted: 3004Descripti
5次阅读

基础但是很重要的2-sat POJ 3678

http://poj.org/problem?id=3678 题目大意:就是给你n个点,m条边,每个点都可以取值为0或者1,边上都会有一个符号op(op=xor or and三种)和一个权值c。然后问你如何选择每个点的值,才能让所有点都满足x[i] op x[j] = c 思路:
4次阅读

poj1743 Musical Theme

Musical ThemeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 28409 Accepted: 9591DescriptionA musical melody i
2次阅读