残疾人康复训练
卖女孩的小fo柴
菜鸡上路
展开
-
Maximum in table
题目: An n × n table a is defined as follows: The first row and the first column contain ones, that is: ai, 1 = a1, i = 1 for all i = 1, 2, …, n. Each of the remaining numbers in the table is equal to t...原创 2019-02-17 10:56:16 · 117 阅读 · 0 评论 -
HDU 1213 How Many Tables--简单并查集
How Many Tables http://acm.hdu.edu.cn/showproblem.php?pid=1213 Problem Description Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many table...原创 2019-02-17 10:59:51 · 99 阅读 · 0 评论 -
Bus to Udayland
Bus to Udayland time limit per test 2 seconds memory limit per test 256 megabytes ZS the Coder and Chris the Baboon are travelling to...原创 2019-02-17 11:03:02 · 145 阅读 · 0 评论 -
Constructing Roads--最小生成树
Constructing Roads Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 22124 Accepted: 9431 Description There are N villages, which ...原创 2019-02-17 11:06:58 · 151 阅读 · 0 评论 -
CodeForces 432A Choosing Teams(水)
Description The Saratov State University Olympiad Programmers Training Center (SSU OPTC) has n students. For each student you know the number of times he/she has participated in the ACM ICPC world pro...原创 2019-02-17 11:19:24 · 102 阅读 · 0 评论 -
poj 1797 Heavy Transportation Dijkstra&&Kruskal
Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cust...原创 2019-02-17 13:36:04 · 175 阅读 · 0 评论 -
FOX and Snake
FOX and Snake time limit per test 2 seconds memory limit per test 256 megabytes Fox Ciel starts to learn programmi...原创 2019-02-17 14:19:13 · 191 阅读 · 0 评论 -
HDU 1754 I Hate It--线段树
Description 很多学校流行一种比较的习惯。老师们很喜欢询问,从某某到某某当中,分数最高的是多少。 这让很多学生很反感。 不管你喜不喜欢,现在需要你做的是,就是按照老师的要求,写一个程序,模拟老师的询问。当然,老师有时候需要更新某位同学的成绩。 Input 本题目包含多组测试,请处理到文件结束。 在每个测试的第一行,有两个正整数 N 和 M ( 0<N<=200000,0<...原创 2019-02-17 14:52:45 · 85 阅读 · 0 评论