POJ 2318 TOYS/POJ 2398 Toy Storage

计算几何终于开坑了。。。叉积+二分。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define maxn 5050using namespace std;s
9次阅读

POJ 1830 开关问题

开关问题Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 8083 Accepted: 3199Description有N个相同的开关,每个开关都与某些开关有着联系,每当你打开或者关闭某个开关的
4次阅读

POJ3974 Palindrome

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

POJ 1845

SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20029 Accepted: 5058DescriptionConsider two natural numbers A and
4次阅读

POJ 2125 Destroying the Graph 二分图最小点权覆盖

Destroying The GraphTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8198 Accepted: 2635 Special JudgeDesc
7次阅读

Balancing Act(poj1655)

Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12703 Accepted: 5403DescriptionConsider a tree T
3次阅读

POJ2417 Discrete Logging

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

POJ 3252 Round Numbers

RT.#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int l,r,dp[33][33][33],ret=0,bit[
4次阅读

SPOJ BALNUM

一开始题看错了。。。dp[pos][sets][viss],其中sets表示出现次数,viss表示出现没有。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>us
3次阅读

POJ 1797 Heavy Transportation(最大生成树/最短路变形)

传送门Heavy TransportationTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 31882 Accepted: 8445DescriptionBackgrou
4次阅读