lxfstyle-CSDN博客

原创 zoj 2109

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1109 按收益排序贪心选择收益最大的交易不够的话按比例交易 用c语言写了一次 hdu 上 WA zoj 超时 c++ STL 今天刚看很好用 #include <iostream> #include <fstream> #include <vector> #inc

2011-03-05 00:32:00 364

原创 HDU 1257 DP + 贪心

最少拦截系统 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4546 Accepted Submission(s): 1697 Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是

2011-03-04 23:28:00 631

原创 hdu 1231

最大连续子序列 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7772 Accepted Submission(s): 3108 Problem Description给定K个整数的序列{ N1, N2, ..., NK }，其任意连续子序列可表示为{ Ni, Ni+1, ...,

2011-03-04 10:46:00 352

原创 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 296

原创 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 316

原创 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 348

原创 POJ 1088 滑雪

滑雪Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 44902Accepted: 16095DescriptionMichael 喜欢滑雪百这并不奇怪，因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 5 16

2011-02-04 16:33:00 328

原创 POJ 1002

487-3279Time Limit: 2000MSMemory Limit: 65536KTotal Submissions: 150828Accepted: 25705 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 504

原创 ZOJ 1195

Blowing FusesTime Limit: 1 Second Memory Limit: 32768 KB Maybe you are familiar with the following situation. You have plugged in a lot of ele

2011-02-03 22:22:00 460

原创 java 在 ACM 中的应用（转帖）

ACM之java速成 2009年03月01日星期日 10:11 这里指的java速成，只限于java语法，包括输入输出，运算处理，字符串和高精度的处理，进制之间的转换等，能解决OJ上的一些高精度题目。1. 输入：格式为：Scanner cin = new Scanner (new BufferedInputStream(System.in));例程： import java.io.*; import java.math.*; import java.util.*; import j

2011-02-03 22:04:00 307

原创 POJ 1028

Web NavigationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18371 Accepted: 8062 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 366

原创 POJ 1042

Gone FishingTime Limit: 2000MSMemory Limit: 32768KTotal Submissions: 18901Accepted: 5322 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 420

原创 ZOJ 1489

2^x mod n = 1Time Limit: 1 Second Memory Limit: 32768 KB Give a number n, find the minimum x that satisfies 2^x mod n = 1. Input One positive

2011-02-03 15:18:00 544

原创 ZOJ 1016

ParencodingsTime Limit: 1 Second Memory Limit: 32768 KB 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 360

原创 POJ 2105

IP AddressTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13839 Accepted: 7910 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 318

原创 ZOJ 1078

Palindrom NumbersTime Limit: 1 Second Memory Limit: 32768 KB Statement of the Problem We say that a number is a palindrom if it is the sane when read fr

2011-02-03 14:15:00 500

L