In geology, a river system can be represented as a directed graph. Each river segment is an edge; with the edge pointing the same way the water flows. Nodes are either the source of a river segment (for example, a lake or spring), where river segment…

这题是今天下午BNU SUMMER TRAINING的C题 是队友给的解题思路,用拓扑排序然后就可以了 最后是3A 其中两次RE竟然是因为: scanf("%d",mm); ORZ 以后能用CIN还是CIN吧 QAQ 贴代码了: #include <stdio.h> #include <string.h> #include <stdlib.h> #include <math.h> #include <iostream> #in…

> 题目链接 题意:给定一个有向图,顶点代表水池,入度为零的定点代表水源,等级是1,他们延河道(有向边)冲撞,对于普通的水池来说,题目给定判断它等级的两个准则,问出度为零的那个点的等级是多少. 是一道拓扑排序,每次寻找入度为零的点入队,直到队列为空. 出现的问题: 当时想的主要思路是对的,但是有一点搞错了,就是对于顶点等级的计算方式,顶点的等级应该是在接受了该顶点所有的入度后再进行计算,否则会出现 1 + 1 + 2 = 3 的 情况. 换句话说就是,考虑的情况不够多,没有考虑到对于一个点,所有…

题目链接 : http://acm.sdibt.edu.cn/vjudge/contest/view.action?cid=2186#problem/C 题意:对于斐波那契数列,每个数都mod m , 问相对应的循环周期是几. 比赛的时候这个题做了一个多小时也没做出来,想过暴力的代码,但是因为看到看到题目中的扩展条件的第二条在最坏的情况下要循环1e12次,就果断放弃了暴力,然后就GG了. 赛后看了题解,发现是加了一个判断标准的纯暴力,这个判断标准做题的时候也想到了,但是感觉证明不了只要前两个数都…

UVALive - 4108 SKYLINE Time Limit: 3000MS     64bit IO Format: %lld & %llu Submit Status uDebug Description   The skyline of Singapore as viewed from the Marina Promenade (shown on the left) is one of the iconic scenes of Singapore. Country X would a…

UVALive - 3942 Remember the Word A potentiometer, or potmeter for short, is an electronic device with a variable electric resistance. It has two terminals and some kind of control mechanism (often a dial, a wheel or a slide) with which the resistance…

UVAlive 3135 Argus Argus Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Internet traffic, fin…

UVAlive 3026 Period 题目: Period   Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description For each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive…

UVAlive 4329 Ping pong 题目: Ping pong Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description N(3N20000) ping pong players live along a west-east street(consider the street as a line segment). Each player ha…

 UVAlive 3983 Robotruck 题目: Robotruck   Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description   Problem C - Robotruck Background This problem is about a robotic truck that distributes mail packages to sev…

UVAlive 4670 Dominating Patterns 题目:   Dominating Patterns   Time Limit: 3000MS   Memory Limit: Unknown   64bit IO Format: %lld & %llu Submit Status Description The archaeologists are going to decipher a very mysterious ``language". Now, they kno…

POJ 1087 A Plug for UNIX / HDU 1526 A Plug for UNIX / ZOJ 1157 A Plug for UNIX / UVA 753 A Plug for UNIX / UVAlive 5418 A Plug for UNIX / SCU 1671 A Plug for UNIX (网络流) Description You are in charge of setting up the press room for the inaugural meet…

D - Blast the Enemy! Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit Status Practice UVALive 4426 Description A new computer game has just arrived and as an active and always-in-the-scene player, you should finish it bef…

G - Profits Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit Status Practice UVALive 4869 Description Your friends have just opened a new business, and you want to see how well they are doing. The business has been runnin…

ayout: post title: 训练指南 UVALive - 3989(稳定婚姻问题) author: "luowentaoaa" catalog: true mathjax: true tags: - 二分图匹配 - 图论 - 训练指南 Ladies' Choice UVALive - 3989 #include<bits/stdc++.h> using namespace std; typedef long long ll; const ll mod=998244…

B - Bing it Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit Status Practice UVALive 4764 Description I guess most of you played cards on the trip to Harbin, but I'm sure you have never played the following card game. Thi…

Road Networks Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit Status Practice UVALive 4262 Description   There is a road network comprised by M<tex2html_verbatim_mark> roads and N<tex2html_verbatim_mark> citie…

The King's Ups and Downs Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVALive. Original ID: 617764-bit integer IO format: %lld      Java class name: Main   The king has guards of all different heights. Rather than line the…

One-way traffic Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVALive. Original ID: 266464-bit integer IO format: %lld      Java class name: Main   In a certain town there are n intersections connected by two- and one-way s…

Street Directions Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVALive. Original ID: 541264-bit integer IO format: %lld      Java class name: Main   According to the Automobile Collision Monitor (ACM), most fatal traffic a…

Critical Links Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVALive. Original ID: 529264-bit integer IO format: %lld      Java class name: Main In a computer network a link L, which interconnects two servers, is considered…

正常查询语句中TOP的运用: SELECT TOP 1000 * FROM MP_MemberGrade   随意更新一张表中满足条件的前N条数据: UPDATE TOP (1) MP_Member SET FKGradeID=2 WHERE IsDeleted=2   更新A表中满足B表前N条记录的数据 UPDATE MP_Member SET FKGradeID=2 FROM MP_Member A LEFT JOIN (SELECT TOP 10 * FROM MP_MemberGrade…

1391: [Ceoi2008]order Time Limit: 10 Sec  Memory Limit: 64 MBSubmit: 1509  Solved: 460[Submit][Status][Discuss] Description 有N个工作,M种机器,每种机器你可以租或者买过来. 每个工作包括若干道工序,每道工序需要某种机器来完成,你可以通过购买或租用机器来完成. 现在给出这些参数,求最大利润 Input 第一行给出 N,M(1<=N<=1200,1<=M<=12…

1Add JAR 从Eclipse的现有所有工程中,添加jar包到该工程下 2Add External JARs 从Eclipse外的其他的位置,添加jar包到该工程下 3Add Variable 增加一个变量 4Add Library 增加一个库 5Add Class Folder 从Eclipse的现有所有工程中,增加一个class文件夹 6Add External Class Folder 从Eclipse的外,增加一个class文件夹 7 Order and Export Order a…

linux 环境下运行ECLIPSE时 出现 “ A Java Runtime Environment (JRE) or Java Development Kit (JDK) must be available in order to run STS. No Java virtual machine was found after searching the following locations: /home/carlos/Documents/soft/sts-bundle/sts-3.7.3…

order by 排序查询.asc升序.desc降序 示例: select * from 学生表 order by 年龄 ---查询学生表信息.按年龄的升序(默认.可缺省.从低到高)排列显示 也可以多条件排序. 比如 order by 年龄,成绩 desc 按年龄升序排列后.再按成绩降序排列 group by 分组查询. having 只能用于group by子句.作用于组内,having条件子句可以直接跟函数表达式.使用group by 子句的查询语句需要使用聚合函数. 示例: select…

order by  跟在select* from 后面 order by 默认的是升序, asc 升序  desc 降序 select * from 表名 order by  字段名  asc 在带有过滤条件的情况下, 跟在where后面 select * from A where  Age>23 order by Salary desc…

今天遇到一个关于SQL转换成Oracle语句的问题,描述如下: select * from emp order by deptno; select * from dept; Sql Server: update dept a set dname=(select top 1 ename from emp where deptno=a.deptno order by sal) 经过尝试,查找资料,得出下面转换结果,不知道这样是否可行: update dept a set dname= (with t…

Sept. 5, 2015 花时间把代码读明白, 比光看书强. 动手写代码, 改代码,  兴趣是最好的老师. 多记几个例子, 增加情趣. 举个例子关于中序遍历,            4         /     \        2       6      /  \     / \     1   3   5   7  easy way to travel is to remember the order of its position in the horizontal way     …

Sept. 13, 2015 Spent more than a few hours to work on the leetcode problem, and my favorite blogs about this problems: 1. http://siddontang.gitbooks.io/leetcode-solution/content/tree/construct_binary_tree.html 2.http://blog.csdn.net/linhuanmars/artic…