https://blog.youkuaiyun.com/inspoyzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/inspoy/article/details/5970332https://blog.youkuaiyun.com/inspoy/article/details/5970332inspoyWed, 27 Oct 2010 22:18:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5968053https://blog.youkuaiyun.com/inspoy/article/details/5968053inspoyTue, 26 Oct 2010 23:55:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5966289https://blog.youkuaiyun.com/inspoy/article/details/5966289inspoyTue, 26 Oct 2010 11:31:00 +0800额...昨天有事，今早更新
 
今天是星期一，嗯嗯，为什么昨天没有呢？
答客曰：星期天休息...XD（众人：CF！！！）
好，今天的呢，有7道题：
谁拿了最多奖学金
过河
拔河比赛
数的计算
过河卒
不高兴的津津
FBI树
 
谁拿了最多奖学金：基本的字符串处理。分析略...
var s:string; n,i,p,q,total,max,max]]>https://blog.youkuaiyun.com/inspoy/article/details/5961394https://blog.youkuaiyun.com/inspoy/article/details/5961394inspoySat, 23 Oct 2010 23:02:00 +0800额，由于某种原因，导致昨天没写总结。今天的：
 
2^k进制数
采药
英语课句型转换
猪王争霸
提示问题
自然的谜语
扫雷
 
Fish学数学   之归并版
 
2^k进制数：比较难，涉及到组合数学及高精度。
program rq8; type arr=array[0..200] of longint; var k,w,maxn,i,tmp:longi]]>https://blog.youkuaiyun.com/inspoy/article/details/5957695https://blog.youkuaiyun.com/inspoy/article/details/5957695inspoyThu, 21 Oct 2010 23:28:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5953099https://blog.youkuaiyun.com/inspoy/article/details/5953099inspoyWed, 20 Oct 2010 07:24:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5950309https://blog.youkuaiyun.com/inspoy/article/details/5950309inspoyTue, 19 Oct 2010 08:43:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5947940https://blog.youkuaiyun.com/inspoy/article/details/5947940inspoyMon, 18 Oct 2010 09:03:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5947494https://blog.youkuaiyun.com/inspoy/article/details/5947494inspoySun, 17 Oct 2010 22:57:00 +0800初赛考完了，考得一塌糊涂。。。。
 
今天在RQ上注册了个新的账号，以后一个月主要就是在这里做题了。
 
今天做的题目：
命名的随机数
开心的金明
Jam的计数法
数列
能量项链
金明的预算方案
作业调度方案
计数的梦
陶陶摘苹果
 
明明的随机数：不多说，桶排序。
program rq1; var a:array[1..1000]]>https://blog.youkuaiyun.com/inspoy/article/details/5921577https://blog.youkuaiyun.com/inspoy/article/details/5921577inspoyMon, 04 Oct 2010 18:44:00 +0800QQREADER9B4EE4324EC44C58]]>https://blog.youkuaiyun.com/inspoy/article/details/5918990https://blog.youkuaiyun.com/inspoy/article/details/5918990inspoySat, 02 Oct 2010 21:02:00 +0800今天，2010年10月2日。
距离复赛只有50天了呢！
明天起就要停课了...
赶紧抓紧了。]]>https://blog.youkuaiyun.com/inspoy/article/details/5917145https://blog.youkuaiyun.com/inspoy/article/details/5917145inspoyThu, 30 Sep 2010 21:12:00 +0800这是我的QQ在线状态
]]>https://blog.youkuaiyun.com/inspoy/article/details/5852669https://blog.youkuaiyun.com/inspoy/article/details/5852669inspoyTue, 31 Aug 2010 13:31:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5709689https://blog.youkuaiyun.com/inspoy/article/details/5709689inspoyFri, 02 Jul 2010 17:03:00 +0800等差数列，在那本紫皮的书上有。]]>https://blog.youkuaiyun.com/inspoy/article/details/5709677https://blog.youkuaiyun.com/inspoy/article/details/5709677inspoyFri, 02 Jul 2010 16:55:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5709599https://blog.youkuaiyun.com/inspoy/article/details/5709599inspoyFri, 02 Jul 2010 16:31:00 +0800https://blog.youkuaiyun.com/inspoy/article/details/5697593https://blog.youkuaiyun.com/inspoy/article/details/5697593inspoySun, 27 Jun 2010 16:07:00 +0800题目（From NOCOW）
暴力的枚举...
{ ID:asdcyt01 PROB:crypt1 LANG:PASCAL } program crypt1(input,output); var n,i,i1,i2,i3,j1,j2,tot,x,y,z,num:longint; a:set of byte; function analyze(x:longint):boolean; var y:longint; begin while x>0]]>https://blog.youkuaiyun.com/inspoy/article/details/5697586https://blog.youkuaiyun.com/inspoy/article/details/5697586inspoySun, 27 Jun 2010 16:05:00 +0800题目在这里
这道题折腾了我好几天！
先用搜索写了一个代码，结果搜索写sd了，竟然TLE！
只好改写DP。
方程：
f[i]:=f[i-1]+2(a[i]=a[i-f[i-1]-1] )
f[i]:=2(a[i]=a[i-1]) 
f[i]:=1(else)
代码在此：
{ ID:asdcyt01 PROB:calfflac LANG:PASCAL } var n,i,len,max,maxi]]>https://blog.youkuaiyun.com/inspoy/article/details/5693788https://blog.youkuaiyun.com/inspoy/article/details/5693788inspoyFri, 25 Jun 2010 13:20:00 +0800题目
先用一块木板，把全部的牛棚都围上，然后把最大的空缺（没牛的地方）拆掉，如此执行n-1次，计算出最后剩下的总长度。
{ ID:asdcyt01 PROB:barn1 LANG:PASCAL } program barn1(input,output); var a:array[1..200]of boolean; b:array[1..200]of longint; n,m,c,k,p,i:longint; aa,bb:boolean; ]]>https://blog.youkuaiyun.com/inspoy/article/details/5691372https://blog.youkuaiyun.com/inspoy/article/details/5691372inspoyThu, 24 Jun 2010 13:45:00 +0800题目在这里：http://www.nocow.cn/index.php/Translate:USACO/milk
水题一只，不解释，直接上代码：
{ ID:asdcyt01 PROB:milk LANG:PASCAL } program milk(input,output); var n,m,i,total,totalmoney:longint; a,p:array[1..5000]of longint; procedure sort(l,r:longi]]>