6 小小灵瞳

尚未进行身份认证

暂无相关简介

等级
TA的排名 54w+

red and black

B - Red and BlackTime Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThere is a rectangular room, covered with square tiles. Each tile is co

2015-04-10 21:25:29

pots

A - Pots Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u SubmitStatus Description You are given two pots, having the volume of A and B liters respectively. The followin

2015-04-10 21:17:04

More is better---并查集实践

More is betterTime Limit: 5000/1000 MS (Java/Others)    Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 16248    Accepted Submission(s): 5978Problem DescriptionMr Wang

2015-01-27 09:48:04

小希的迷宫---并查集实践

小希的迷宫Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28862    Accepted Submission(s): 8908Problem Description上次Gardon的迷宫城堡小希玩了很久

2015-01-27 09:30:50

UVA---458解码器

Write a complete program that will correctly decode a set of characters into a valid message. Your program should read a given file of a simple coded set of characters and print the  exact message tha

2014-11-02 16:23:37

动态规划---最长公共子序列

动态规划---最长公共子序列1.分析最优解的结构设有X={x1,x2,x3,...,xm}以及Y={y1,y2,y3,...,yn}两个序列,求他们的最长公共子序列。首先考虑穷搜索法,则发现需要指数时间。这是一种极浪费时间的一种做法。然后考虑动态规划,设他们的最长公共子序列为Z={z1,z2,z3,...,zk}该问题的最优子结构性质是:(1)若xm=yn,则zk=xm

2014-09-11 23:38:36

博弈初接触---Brave Game

问题描述:

2014-09-01 22:36:30
勋章 我的勋章
    暂无奖章