搜索
文章平均质量分 70
zwzwzwh
Lonely God
展开
-
组队赛(一)F - Low Power
6398 Low PowerYou are building advanced chips for machines. Making the chips is easy, but the power supply turnsout to be an issue since the available batteries have varied power outputs.Conside原创 2014-03-16 15:15:58 · 832 阅读 · 0 评论 -
wiki oi 1051 接龙游戏
1051 接龙游戏 题目描述 Description给出了N个单词,已经按长度排好了序。如果某单词i是某单词j的前缀,i->j算一次接龙(两个相同的单词不能算接龙)。你的任务是:对于输入的单词,找出最长的龙。输入描述 Input Description第一行为N(15)。以下N行每行一个单词(由小写组成),已经按长度排原创 2014-07-26 11:38:25 · 931 阅读 · 0 评论 -
HDU 4970 Killing Monsters 【搜索】
机智的搜索原创 2014-08-19 22:07:32 · 725 阅读 · 0 评论 -
UVALive 6606 Meeting Room Arrangement 【搜索】
搜索原创 2014-08-20 14:35:48 · 999 阅读 · 0 评论 -
HDU 4259 Double Dealing【简单群置换】
简单群置换原创 2014-09-20 20:43:44 · 976 阅读 · 0 评论 -
HDU 4941 Magical Forest 【离散化】【map】
离散化原创 2014-08-13 00:09:24 · 1488 阅读 · 1 评论 -
HDU 4937 Lucky Number 【搜索】
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4937搜索机智的暴力原创 2014-08-15 09:54:02 · 736 阅读 · 0 评论 -
poj2318 TOYS 【计算几何】【点和线的关系】
点和线简单题目原创 2014-09-23 15:44:24 · 1000 阅读 · 0 评论 -
HDU 4821 String
StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 451 Accepted Submission(s): 123Problem DescriptionGiven a string S and原创 2014-07-26 10:15:48 · 773 阅读 · 2 评论 -
Zoj 3616 Choir III 【有想法的暴力】【容斥】
机智的暴力原创 2014-09-01 21:30:56 · 653 阅读 · 0 评论 -
1618 - Weak Key【贪心】【搜索】
题目大意样例inputoutput解释思路代码Hit题目大意[传送门]https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=845&page=show_problem&problem=4493给出n个case 每个case中有m个数字,对于每一组case,问是否存在4个整数Np N原创 2017-05-13 10:23:53 · 404 阅读 · 0 评论 -
uva1627 - Team them up!【dp】
题目大意思路代码Hit题目大意传送门有n个人,把他们分成非空的两组,使得每个人都被分到一组,并且同组的人要相互认识。要求两组的人数要尽量接近。多解的时候输出任意方案,无解时候输出No Solution。思路组的编号为0和1。因为同组的人必须相互认识,如果已知某个人在组0,那么不认识此人的就必须在组1。让不认识关系组成一张图。例如: 1 认识 2 3 5 2 认识 1 3 4 5 3原创 2017-11-28 22:40:31 · 274 阅读 · 0 评论 -
树型DP基础题目总结
树的最大独立集树的重心 树的重心被定义为:对于一棵n个结点的无根树,找到一个点,使得把树变成以该点为根的有根树的时候,最大子树的结点数最小。输入数据:结点数N无向边N-1条输出数据:重心为哪个点最大子树的结点数对无根树进行DFS,求取每个结点对应的最大子树的节点数,最后使整个值最小即可。#include <cstdio>#include <cstdlib>#include <c原创 2017-11-08 15:26:56 · 315 阅读 · 0 评论 -
poj 1753 Flip Game
Flip GameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 30395 Accepted: 13199DescriptionFlip game is played on a rectangular 4x4 field with two-sided原创 2014-07-26 22:03:28 · 583 阅读 · 0 评论 -
HDU 4791 Alice's Print Service 【贪心+二分】
题目链接: 传送门题目大意:给你原创 2014-07-31 21:47:34 · 606 阅读 · 0 评论 -
UVALive6661 Equal Sum Sets
题目链接:https://icpcarchive.ecs.baylor.edu/external/66/6661.pdf 题目大意:在给出的nsk原创 2014-07-19 15:50:46 · 686 阅读 · 0 评论 -
poj 1416 Shredding Company
Shredding CompanyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 3849 Accepted: 2181DescriptionYou have just been put in charge of developing a new shredd原创 2014-07-19 15:05:51 · 587 阅读 · 0 评论 -
string copy find
先说一个c语言暴力写的#include#includeint main(){char a[80],b[40];int na,nb,i,j,flag;gets(a);gets(b);na=strlen(a), nb=strlen(b);flag=0;for(i=0;na-i>=nb;i++) { flag=1; for(原创 2013-07-05 17:17:03 · 653 阅读 · 0 评论 -
Poj1018 Communication System
Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20836 Accepted: 7381DescriptionWe have received an order from Pizoor Communications In原创 2013-07-23 12:17:27 · 815 阅读 · 0 评论 -
UVALive6662 The Last Ant
题目链接https://icpcarchive.ecs.baylor.edu/external/66/6662.pdf原创 2014-07-19 16:11:35 · 728 阅读 · 0 评论 -
UVALive6663 Count the Regions
题目链接:https://icpcarchive.ecs.baylor.edu/external/66/6663.pdf题目大意:给你很多原创 2014-07-19 16:22:33 · 664 阅读 · 0 评论 -
uva10125 Sumsets
SumsetsGiven S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S.InputSeveral S, each consisting of a line containing an integer 1转载 2013-11-28 20:57:24 · 696 阅读 · 0 评论 -
poj 3349 Snowflake Snow Snowflakes
Snowflake Snow SnowflakesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 30614 Accepted: 8058DescriptionYou may have heard that no two snowflakes are al原创 2014-07-22 10:05:29 · 577 阅读 · 0 评论 -
poj 1840 Eqs
EqsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 11861 Accepted: 5808DescriptionConsider equations having the following form: a1x13+ a2x23+ a3x33+原创 2014-07-23 19:47:39 · 566 阅读 · 0 评论 -
poj 2503 Babelfish
BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 31743 Accepted: 13656DescriptionYou have just moved from Waterloo to a big city. The people h原创 2014-07-25 16:58:34 · 508 阅读 · 0 评论 -
poj 2002 Squares
SquaresTime Limit: 3500MS Memory Limit: 65536KTotal Submissions: 15879 Accepted: 6009DescriptionA square is a 4-sided polygon whose sides have equal length and原创 2014-07-24 21:53:32 · 525 阅读 · 0 评论 -
wiki oi 1009 产生数
1009 产生数原创 2014-07-26 15:40:06 · 919 阅读 · 0 评论 -
51nod 1307 绳子与重物【并查集】【搜索】【二分法】
题目大意思路思路1 二分DFS思路2 并查集代码1 二分DFSHit题目大意传送门给出 每个绳子的承重Ci 小球的重量Wi 小球挂在那个小球上Pi问最多挂多少个绳子而不会出现绳子断掉的情况。思路本文是看教程:O(n)可以解决的2道题习题的第二题。思路1 二分+DFS按照我的想法,对绳子的列表进行二分O(logn)O(logn),每次判断绳子会不会断掉O(n)O(n),使用DFS。最后原创 2017-09-11 15:07:54 · 251 阅读 · 0 评论