Ramanujan

2013年10月26日

摘要： I Hate ItTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29361Accepted Submission(s): 11640Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。Input本题目包含多组测试，请处理到文件结束。在每阅读全文

posted @ 2013-10-26 23:36 Ramanujan 阅读(174) 评论(0) 推荐(0) 编辑

hdu 1166 线段树

摘要：关于举办计算机学院大学生程序设计竞赛（2013’11）的报名通知敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32663Accepted Submission(s): 14009Problem Description C国的死对头A国这段时间正在进行军事演习，所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的. 阅读全文

posted @ 2013-10-26 22:15 Ramanujan 阅读(178) 评论(0) 推荐(0) 编辑

zoj 3686 线段树

摘要： A Simple Tree ProblemTime Limit: 3 Seconds Memory Limit: 65536 KBGiven a rooted tree, each node has a boolean (0 or 1) labeled on it. Initially, all the labels are 0.We define this kind of operation: given a subtree, negate all its labels.And we want to query the numbers of 1's of a subtree.Inpu 阅读全文

posted @ 2013-10-26 22:12 Ramanujan 阅读(186) 评论(0) 推荐(0) 编辑

2013年10月21日

阶段性题量

摘要： For Beginners如图：1.dfs Beginners2.shortest Path3.mst4.Bipartite Graph Matching5.Network Flow 阅读全文

posted @ 2013-10-21 00:58 Ramanujan 阅读(155) 评论(0) 推荐(0) 编辑

uva 610 强连通分量 / 桥

摘要： Street DirectionsAccording to the Automobile Collision Monitor (ACM), most fatal traffic accidents occur on two-way streets. In order to reduce the number of fatalities caused by traffic accidents, the mayor wants to convert as many streets as possible into one-way streets. You have been hired to p. 阅读全文

posted @ 2013-10-21 00:47 Ramanujan 阅读(227) 评论(0) 推荐(0) 编辑

uva 11504 强连通分量 && 缩点

摘要： Problem D: DominosDominos are lots of fun. Children like to stand the tiles on their side in long lines. When one domino falls, it knocks down the next one, which knocks down the one after that, all the way down the line. However, sometimes a domino fails to knock the next one down. In that case, we 阅读全文

posted @ 2013-10-21 00:47 Ramanujan 阅读(222) 评论(0) 推荐(0) 编辑

hdu 3062 2-sat

摘要： PartyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3521Accepted Submission(s): 1141Problem Description有n对夫妻被邀请参加一个聚会，因为场地的问题，每对夫妻中只有1人可以列席。在2n 个人中，某些人之间有着很大的矛盾（当然夫妻之间是没有矛盾的），有矛盾的2个人是不会同时出现在聚会上的。有没有可能会有n 个人同时列席？Inputn：表示有n对夫妻被邀请 (n#include#includ 阅读全文

posted @ 2013-10-21 00:44 Ramanujan 阅读(151) 评论(0) 推荐(0) 编辑

2013年10月20日

uva 10765 tarjan / 点双连通分量

摘要： Problem GDoves and BombsInput: Standard InputOutput: Standard OutputTime Limit: 2 SecondsIt is the year 95 ACM (After the Crash of Microsoft). After many years of peace, a war has broken out. Your nation, the island of Evergreen Macros And Confusing Shortcuts (EMACS), is defending itself against the 阅读全文

posted @ 2013-10-20 01:38 Ramanujan 阅读(278) 评论(0) 推荐(0) 编辑

uva 11080 二分图判定

摘要： Problem GPlace the GuardsInput: Standard InputOutput: Standard OutputIn the country of Ajabdesh there are some streets and junctions. Each streetconnects 2 junctions. The king of Ajabdesh wants toplace some guards in some junctions so that all the junctions and streets canbe guarded by them. A guard 阅读全文

posted @ 2013-10-20 01:36 Ramanujan 阅读(208) 评论(0) 推荐(0) 编辑

uva 11396 二分图判定

摘要： #include#include#include#include#include#include#include#include#include#include#includeusing namespace std;#define LL long long#define UINT unsigned int#define MAX_INT 0x7fffffff#define cint const int#define MAXN 333vector g[MAXN];int n, col[MAXN];bool dfs(int u, int color){ col[u] = color; f... 阅读全文

posted @ 2013-10-20 01:31 Ramanujan 阅读(256) 评论(0) 推荐(0) 编辑

; -)