- 博客(16)
- 收藏
- 关注
原创 zoj 2109
<br />http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1109<br /> <br />按收益排序 贪心选择 收益最大的 交易 不够的话 按比例交易<br /> <br />用c语言 写了一次 hdu 上 WA zoj 超时<br /> <br />c++ STL 今天刚看 很好用<br /> <br />#include <iostream>#include <fstream>#include <vector>#inc
2011-03-05 00:32:00 378
原创 HDU 1257 DP + 贪心
最少拦截系统<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 4546 Accepted Submission(s): 1697<br /><br />Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是
2011-03-04 23:28:00 647
原创 hdu 1231
最大连续子序列<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 7772 Accepted Submission(s): 3108<br /><br />Problem Description给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ..., <br />
2011-03-04 10:46:00 368
原创 POJ 1458 最长公共子序列
Common SubsequenceTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 22315Accepted: 8513DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence
2011-03-02 10:28:00 310
原创 HDU 1087 简单DP
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8054 Accepted Submission(s): 3255Problem DescriptionNowadays, a kind of chess game called “Super Jumping! Jumping
2011-02-06 13:18:00 334
原创 HDU 1020
EncodingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9953 Accepted Submission(s): 4083Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method
2011-02-05 22:50:00 363
原创 POJ 1088 滑雪
滑雪Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 44902Accepted: 16095DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516
2011-02-04 16:33:00 344
原创 POJ 1002
487-3279Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 150828Accepted: 25705<br />DescriptionBusinesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phr
2011-02-04 12:32:00 522
原创 ZOJ 1195
Blowing FusesTime Limit: 1 Second Memory Limit: 32768 KB <br /> Maybe you are familiar with the following situation. You have plugged in a lot of ele
2011-02-03 22:22:00 480
原创 java 在 ACM 中的应用 (转帖)
ACM之java速成2009年03月01日星期日10:11 这里指的java速成,只限于java语法,包括输入输出,运算处理,字符串和高精度的处理,进制之间的转换等,能解决OJ上的一些高精度题目。1. 输入:格式为:Scannercin = new Scanner (new BufferedInputStream(System.in));例程:import java.io.*;import java.math.*;import java.util.*;import j
2011-02-03 22:04:00 318
原创 POJ 1028
Web NavigationTime Limit: 1000MS<br />Memory Limit: 10000KTotal Submissions: 18371<br />Accepted: 8062<br />DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement th
2011-02-03 21:22:00 376
原创 POJ 1042
Gone FishingTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 18901Accepted: 5322<br />DescriptionJohn is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable
2011-02-03 16:01:00 438
原创 ZOJ 1489
2^x mod n = 1Time Limit: 1 Second Memory Limit: 32768 KB <br />Give a number n, find the minimum x that satisfies 2^x mod n = 1.<br /><br />Input<br />One positive
2011-02-03 15:18:00 563
原创 ZOJ 1016
<br /> ParencodingsTime Limit: 1 Second Memory Limit: 32768 KB <br /> Let S = s1 s2 ... s2n be a well-formed string of parentheses. S can be encoded in two diff
2011-02-03 14:56:00 374
原创 POJ 2105
IP AddressTime Limit: 1000MS<br />Memory Limit: 30000KTotal Submissions: 13839<br />Accepted: 7910<br />DescriptionSuppose you are reading byte streams from any device, representing IP addresses. Your task is to convert a 32 characters long seq
2011-02-03 14:47:00 338
原创 ZOJ 1078
Palindrom NumbersTime Limit: 1 Second Memory Limit: 32768 KB <br />Statement of the Problem <br />We say that a number is a palindrom if it is the sane when read fr
2011-02-03 14:15:00 517
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人