LaMarcus-优快云博客

原创 NOI 2005-lemon

题目大意：给出n个首尾相接的圆台（首尾面积相等），有一束平行光，与地面夹角为alpha，求投影面积。分析：直接做太囧了，于是想到了积分。首先，那些圆被投影下来还是圆，圆台侧面投影下来自然就是公切线了，于是问题就转化为求n个圆心在一条线上的

2011-08-31 17:20:24 511

原创 sgu 345-Revolution

题目大意：输入n个点，求凸包。然后给出m条直线，每次询问被直线切割的凸包的两部分面积的较小值。分析：本题是一个难度较大的计算几何题，难就难在求直线切割凸包，至于凸包的求法我就不再阐述了，就是Graham贪心法。凸包求出来之后呢，因为有m

2011-07-29 09:51:47 1055

原创 HNOI 2011-race

题目大意：比较复杂。是说一个人开车，要走若干折线段，给出参数a,b，耗油量为max(0,av+bs)(s为斜率)每单位长度，有个vmax和油量，问开完的最短时间。（开不完输出'IMPOSSIBLE'）。分析：咋一看是dp，其实不然，状态非常难设计。

2011-07-19 15:26:08 641

原创 HNOI 2011-rectangle

题目大意：给出平面上n(n分析：看似本题没法做，它还是有很巧妙的解法的。首先我们来分析一下四个点围成矩形的特征：易证明若两对点它们的中点重合且距离相等，则那四个点围成的四边形就是矩形。于是我们可以构造一个事件，记录每对点的中点坐标和距离

2011-07-17 20:14:50 625

原创 HNOI 2011-homework

题目大意：给出n,m(n分析：题目还是比较简单的，首先可以非常简单地得到一个递推式，f[i]表示第i个数mod m的值，则f[i]=f[i-1]*(10^digit(i))+i，其中digit(i)表示i的位数，裸着去递推显然会爆掉，很

2011-07-17 15:07:32 535

原创欧几里得算法

这个算法再基础不过（求最大公约数），实际上就是更相减损术，每次拿较大的减去较小的，直到减为0，最后的那个减数即为答案。为了不在做减法时重复做巧用mod取余然后直接交换。代码如下：function gcd(a,b:longint):longint;begin if b=

2011-05-22 23:15:00 581

原创扩展欧几里得算法

这个是数论中的最基础的东西，用途也很明确，就是解线性二元一次不定方程的整数解（不一定非负），在解线性同余方程的时候也有用，易证若方程ax+by=c有整数解，则gcd(a,b)|c（在此不证明），我们便可以利用它的这一性质与欧几里得算法结合，先巩固一下欧几里得算法，其实就是求最大公

2011-05-22 23:06:00 572

原创 sgu Source

100-A+B102-Coprimes123-The sum135-Drawing Lines106-The Equation345-Revolution

2011-05-12 22:24:00 396

原创 POJ 1183-arctan

简单枚举：{ Author:wzx961008 Problem:POJ 1183-arctan Verdict:Accepted Language:PASCAL Run Time:0.032s AC Date:2011-4-19}var a,b,c,k,ans

2011-04-19 20:59:00 452

原创 POJ 1182-eat

简单的并查集的应用，经典题目：{ Author:wzx961008 Problem:POJ 1182-eat Verdict:Accepted Language:PASCAL Run Time:0.188s AC Date:2011-4-19}var i,n,k,d

2011-04-19 20:36:00 506

原创 JSOI 2008-help

题目大意：已知n个与x轴平行的平台，和一个出发点，物体从出发点自由下落。落到平台上可向左或向右，求落到地面的最短时间。落不下来输出-1。分析：dp题目，不难，先按高从大到小将平台快排一遍，令left[i],right[i]-落到第i个平台向左走和向右走的最短时间，从后往前dp：

2011-04-09 12:19:00 599

原创 POI IX 2001-2002 Stage II-dzi

简单dp：{ Author:wzx961008 Problem:POI IX 2001-2002 Stage II-dzi Verdict:Accepted Language:PASCAL Run Time:5.620s AC Date:2011-3-26}uses

2011-03-26 17:46:00 619

原创 POI IX 2001-2002 Stage II-izo

超级大水题，快排+贪心，每次拿最大的减最小的： { Author:wzx961008 Problem:POI IX 2001-2002 Stage II-izo Verdict:Accepted Language:PASCAL Run Time:0.390s AC Date:2011-3-26}const maxn=100000;var a:array[1..maxn]of qword; n,i,point:longint; an

2011-03-26 17:03:00 489

原创 UVa OJ 10171-Meeting Prof. Miguel...

本来一个Floyd Warshall可以秒过的，但是我用了Dijikstra+heap锻炼水平，并且数据大时也不怕，算法：分别以各自能否走构两个图，枚举每个碰面点，分别在这两个图里做最短路，加起来最短的那个就是碰面点： Source:UVa OJ 10171-Meeting Prof. Miguel...

2011-03-24 22:33:00 1108

原创 UVa OJ 11935-Through the Desert

模拟： { Author:wzx961008 Problem:UVa 11935-Through the Desert Verdict:Accepted Language:PASCAL Run Time:0.004s Submission Date:2011-03-23 16:37:16}var now_csp,now_loc,last_loc,leak_num,space_num:longint; now_fuel,min_volume:ex

2011-03-24 01:26:00 745

原创 UVa OJ 11934-Magic Formula

数学题： { Author:wzx961008 Problem:UVa 11934-Magic Formula Verdict:Accepted Language:PASCAL Run Time:0.004s Submission Date:2011-03-23 16:36:15}var a,b,c,d,L,i,tot:longint;function f(x:integer):longint;begin exit(a*x*x+b*x+c);

2011-03-24 01:24:00 615

原创 UVa OJ 11933-Splitting Numbers

还是模拟： { Author:wzx961008 Problem:UVa 11933-Splitting Numbers Verdict:Accepted Language:PASCAL Run Time:0.012s Submission Date:2011-03-23 16:35:17}uses math;var ans1,ans2,len,n,i,num:longint; s,a,b:string;function change_

2011-03-24 01:22:00 838

原创 UVa OJ 11926-Multitasking

模拟： { Author:wzx961008 Problem:UVa 11926-Multitasking Verdict:Accepted Language:PASCAL Run Time:0.084s Submission Date:2011-03-23 16:32:05}const maxnum=1000000;var ok1,ok2:array[0..1000000]of boolean; n,m,T,i,l,r,ta

2011-03-24 01:19:00 666

原创 UVa OJ 11015-05-2 Rendezvous

图论水题，一个裸的Floyd Warshall再枚举： { Author:wzx961008 Problem:UVa 11015-05-2 Rendezvous Verdict:Accepted Language:PASCAL Run Time:0.012s Submission Date:2011-03-22 12:48:53}const oo=maxlongint;var graph:array[1..22,1..22]of qword;

2011-03-22 20:55:00 645

原创 UVa OJ 10909-Soya Milk

最简单几何，比较阴险： { Author:wzx961008 Problem:UVa 11909-Soya Milk Verdict:Accepted Language:PASCAL Run Time:0.016s Submission Date:2011-02-09 13:55:34}var l,w,h,alpha,volume:longint; ans,empty,sinval,cosval:extended;begin while

2011-03-19 22:32:00 540

原创 UVa OJ 11462-Age Sort

快排： { Author:wzx961008 Problem:UVa 11462-Age Sort Verdict:Accepted Language:PASCAL Run Time:0.948s Submission Date:2011-02-14 09:34:03}var a:array[1..2000000]of longint; n,i:longint;procedure qsort(l,r:longint);va

2011-03-19 17:36:00 715

原创 UVa OJ 10591-Happy Number

模拟： { Author:wzx961008 Problem:UVa 10591-Happy Number Verdict:Accepted Language:PASCAL Run Time:0.016s Submission Date:2011-03-05 06:32:08}var n,i,num:longint; f:array[1..1000]of boolean;function happy(num:longint):boolean

2011-03-19 17:31:00 531

原创 UVa OJ 11727-Cost Cutting

题目能够水成这样： { Author:wzx961008 Problem:UVa 11727-Cost Cutting Verdict:Accepted Language:PASCAL Run Time:0.012s Submission Date:2011-02-11 09:39:13}var n,i,a,b,c:longint;begin readln(n); for i:=1 to n do begin readln(a,b,c)

2011-03-19 17:27:00 604

原创 UVa OJ 11461-Square Numbers

简单题，判断区间的平方数个数： { Author:wzx961008 Problem:UVa 11461-Square Numbers Verdict:Accepted Language:PASCAL Run Time:0.028s Submission Date:2011-02-11 05:31:21}var a,b,i,ans:longint; f:array[1..100000]of -1..1;begin while not e

2011-02-11 13:33:00 472

原创 UVa OJ 11417-GCD

最大公约数： { Author:wzx961008 Problem:UVa 11417-GCD Verdict:Accepted Language:PASCAL Run Time:0.044s Submission Date:2011-02-11 03:54:23}var i,j,g,n:longint; f:array[1..501,1..501]of longint;function gcd(a,b:longint):lo

2011-02-11 12:01:00 753 1

原创 UVa OJ 10302-Summation of Polynomials

水题，直接模拟： { Author:wzx961008 Problem:UVa 10302-Summation of Polynomials Verdict:Accepted Language:PASCAL Run Time:0.096s Submission Date:2011-02-11 03:39:05}var n:longint; ans,i:qword; f:array[1..50000]of qword;begin

2011-02-11 11:42:00 490

原创 UVa OJ 11636-Hello World!

巨水： { Author:wzx961008 Problem:UVa 11636-Hello World! Verdict:Accepted Language:PASCAL Run Time:0.012s Submission Date:2011-02-10 08:19:21}var casenum,num,ans,t,n:longint;begin while true do begin inc(casenum); readln(n

2011-02-10 16:21:00 1057

原创 UVa OJ 748-Exponentiation

高精：{ # Problem Verdict Language Run Time Submission Date 8567185 748 Exponentiation Accepted PASCAL 0.016 2011-02-09 12:55:02}var s:string[9]; base,ans:ansistring; pt,ps,pp,i,m:longint;function HighMult

2011-02-09 20:57:00 651

原创 UVa OJ 10106-Product

高精： { Author:wzx961008 Problem:UVa 10106-Product Verdict:Accepted Language:PASCAL Run Time:0.020s Submission Date:2011-02-09 11:43:13}var a,b:string;function HighMultiply(s1,s2:string):ansistring;var a,b,c:array[1..100

2011-02-09 19:55:00 615

原创 UVa OJ 673-Parentheses

用栈轻松解决： { Author:wzx961008 Problem:UVa 673-Parentheses Balance Verdict:Accepted Language:PASCAL Run Time:0.136s Submission Date:2011-02-07 06:40:45}var n,i,top:longint; stack:array[1..128]of char; c:char;functi

2011-02-07 14:44:00 461

原创 UVa OJ 424-Integer Inquiry

高精： { Author:wzx961008 Problem:UVa 424-Integer Inquiry Verdict:Accepted Language:PASCAL Run Time:0.004s Submission Date:2011-02-03 15:23:17}var sum,n:string;function HighPlus(s1,s2:string):string;var a,b,c:array[1..103]of int

2011-02-03 23:25:00 599

原创 UVa OJ 406-Prime Cuts

简单质数运算，一开始格式错误，哎，然后加了个hash： { Author:wzx961008 Problem:UVa 406-Prime Cuts Verdict:Accepted Language:PASCAL Run Time:0.096s Submission Date:2011-02-03 15:04:49}uses math;var i,n,c,top,sum,point:longint; stack:array[1..1000]

2011-02-03 23:13:00 888

原创 UVa OJ 10008-What's Cryptanalysis?

简单统计，水题： { Author:wzx961008 Problem:UVa 10008-What's Cryptanalysis? Verdict:Accepted Language:PASCAL Run Time:0.016s Submission Date:2011-01-30 16:26:08}type letter=record c:char; num:longint;

2011-01-31 00:32:00 572

原创 UVa OJ 10929-You can say 11

水题： { Author:wzx961008 Problem:UVa 10929-You can say 11 Verdict:Accepted Language:PASCAL Run Time:0.032s Submission Date:2011-01-30 15:54:17}var n:ansistring; sum,i:longint;begin while true do begin readln(n);

2011-01-30 23:59:00 489

原创 UVa OJ 10994-Simple Addition

纯数学题，搞了好久： { Author:wzx961008 Problem:UVa 10994-Simple Addition Verdict:Accepted Language:PASCAL Run Time:0.028s Submission Date:2011-01-30 15:00:23}var p,q:longint;function f(n:int64):int64;var ans:int64; i:longi

2011-01-30 23:09:00 504

原创 UVa OJ 495-Fibonacci Freeze

水题，高精： { Author:wzx961008 Problem:UVa 495-Fibonacci Freeze Verdict:Accepted Language:PASCAL Run Time:0.660s Submission Date:2011-01-27 15:59:00}var f:array[0..5001]of ansistring; n:array[1..10000]of longint; i,t,

2011-01-28 12:38:00 703

原创 UVa OJ 10405-Longest Common Subsequence

动归水题： { Author:wzx961008 Problem:UVa 10405-Longest Common Subsequence Verdict:Accepted Language:PASCAL Run Time:0.096s Submission Date:2011-01-16 08:47:29}uses math;var s1,s2:ansistring; l1,l2,i,j:longint; f:ar

2011-01-16 16:53:00 443

原创 UVa OJ 488-Triangle Wave

简单模拟： { Author:wzx961008 Problem:UVa 488-Triangle Wave Verdict:Accepted Language:PASCAL Run Time:0.248s Submission Date:2011-03-19 04:29:26}var n,i,j,k,t,cas,amp,fre:longint;begin readln(n); for cas:=1 to n do begin

2011-01-15 11:43:00 587

原创 UVa OJ 445-Marvelous Mazes

非常简单的模拟： { Author:wzx961008 Problem:UVa 445-Marvelous Mazes Verdict:Accepted Language:PASCAL Run Time:0.004s Submission Date:2011-01-15 01:40:14}var s:string; t,i,j:longint;begin while not eof do begin readln(

2011-01-15 09:47:00 706

原创 UVa OJ 490-Rotating Sentences

简单题： { Author:wzx961008 Problem:UVa 490-Rotating Sentences Verdict:Accepted Language:PASCAL Run Time:0.016s Submission Date:2011-01-15 01:15:14}uses math;var s:string; i,num:longint; ans:array[1..100]of strin

2011-01-15 09:20:00 466

空空如也

空空如也