码迷,mamicode.com
首页 >  
搜索关键字:time    ( 52982个结果
HDU 1231 最大连续子序列
最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20272Accepted Submission(s): 8973Problem De...
分类:其他好文   时间:2015-01-17 09:57:31    阅读次数:167
CSU 1120 病毒(经典模板例题:最长公共递增子序列)
1120: 病毒Time Limit: 3 SecMemory Limit: 128 MBSubmit: 390Solved: 153[Submit][Status][Web Board]Description你有一个日志文件,里面记录着各种系统事件的详细信息。自然的,事件的时间戳按照严格递增顺序排...
分类:其他好文   时间:2015-01-17 09:55:38    阅读次数:140
ural 1073. Square Country 完全背包
点击打开链接 1073. Square Country Time limit: 1.0 second Memory limit: 64 MB There live square people in a square country. Everything in this country is square also. Thus, the Square P...
分类:其他好文   时间:2015-01-17 01:16:52    阅读次数:172
ZOJ 1610 Count the Colors(线段树lazy+暴力统计)
Count the Colors Time Limit: 2 Seconds      Memory Limit: 65536 KB Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones. Your ta...
分类:其他好文   时间:2015-01-17 01:09:12    阅读次数:293
HPUOJ1295 核反应堆
核反应堆 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10959    Accepted Submission(s): 4990 Problem Description 某核反应堆有两类事件发生: 高能质点碰...
分类:其他好文   时间:2015-01-16 23:53:56    阅读次数:360
HDU2080 夹角有多大II
夹角有多大II Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 7676    Accepted Submission(s): 3858 Problem Description 这次xhd面临的问题是这样的:在一个...
分类:其他好文   时间:2015-01-16 23:49:45    阅读次数:265
hdu1757-- A Simple Math Problem(矩阵快速幂优化)
A Simple Math Problem Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description Lele now is thinking about a simple function f(x).  If x...
分类:其他好文   时间:2015-01-16 22:28:47    阅读次数:186
poj3233Matrix Power Series(矩阵快速幂,两种写法)
Matrix Power Series Time Limit:3000MS     Memory Limit:131072KB     64bit IO Format:%I64d & %I64u Submit Status Description Given a n × n matrix A and a positive integer k, find the ...
分类:其他好文   时间:2015-01-16 22:27:50    阅读次数:319
Climbing Stairs
https://oj.leetcode.com/problems/climbing-stairs/You are climbing a stair case. It takesnsteps to reach to the top.Each time you can either climb 1 or...
分类:其他好文   时间:2015-01-16 22:20:56    阅读次数:252
HDU 5073 Galaxy(贪心)
题目大意:给你n个点,拿走k个之后,让你求出怎么拿使得剩下的inertia最小。 解体思路:贪心的策略。剩下的数只有当连续的时候,值会最小,枚举一遍求出来间距为n-k的最小的inertia。 PS:(x1-d)^2+(x2-d)^2+……+(xn-d)^2 = sum(x1^2+……+xn^2)+n*d*d-2*n(sum(x1+x2+……+xn)). Galaxy Time Li...
分类:其他好文   时间:2015-01-16 20:55:25    阅读次数:196
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!