<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Lostwinder的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Lostwinder</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Lostwinder]]></copyright><item><title><![CDATA[ZOJ 1076]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38685225</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38685225</guid><author>Lostwinder</author><pubDate>Tue, 19 Aug 2014 17:26:42 +0800</pubDate><description><![CDATA[题目长……
题目本身是一道很水的LIS题。]]></description><category></category></item><item><title><![CDATA[ZOJ 1284]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38684721</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38684721</guid><author>Lostwinder</author><pubDate>Tue, 19 Aug 2014 17:03:02 +0800</pubDate><description><![CDATA[水题，暴力就可以过。
枚举因数的时候只要枚举2~sqrt(N)就可以了。]]></description><category></category></item><item><title><![CDATA[ZOJ 1278]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38663775</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38663775</guid><author>Lostwinder</author><pubDate>Mon, 18 Aug 2014 17:39:57 +0800</pubDate><description><![CDATA[水题，直接暴力即可。
由于ZOJ无节操地隐去数据范围，苯渣把]]></description><category></category></item><item><title><![CDATA[ZOJ 1278]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38663741</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38663741</guid><author>Lostwinder</author><pubDate>Mon, 18 Aug 2014 17:36:23 +0800</pubDate><description><![CDATA[直接暴力即可- -
由于ZOJ再次无节操地隐去数据范围，我把HASH]]></description><category></category></item><item><title><![CDATA[ZOJ 1027]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38662609</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38662609</guid><author>Lostwinder</author><pubDate>Mon, 18 Aug 2014 16:40:16 +0800</pubDate><description><![CDATA[这是一道DP题。
初看]]></description><category></category></item><item><title><![CDATA[ZOJ 1025]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38661191</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38661191</guid><author>Lostwinder</author><pubDate>Mon, 18 Aug 2014 15:17:30 +0800</pubDate><description><![CDATA[由于顺序可以改变，所以纯贪心解决。
#include "stdio.h"
#include "string.h"
#include "stdlib.h"
struct stick{
	int u,v,num;
}S[5010],stack[5010];
unsigned char vis[5010];
int top;
int cmp(const void *a,const void *b){
]]></description><category></category></item><item><title><![CDATA[ZOJ 1160 Biorhythms]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38642339</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38642339</guid><author>Lostwinder</author><pubDate>Sun, 17 Aug 2014 21:05:04 +0800</pubDate><description><![CDATA[中国剩余定理。
时间：94

//Memory Time 
//256K   94MS 

#include
using namespace std;

int main(void)
{
	int p,e,i,d;
	int time=1;
	while(cin>>p>>e>>i>>d)
	{
		if(p==-1 && e==-1 && i==-1 && d==-1)
			break;
]]></description><category></category></item><item><title><![CDATA[ZOJ 1133 Smith Numbers]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38642209</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38642209</guid><author>Lostwinder</author><pubDate>Sun, 17 Aug 2014 20:52:12 +0800</pubDate><description><![CDATA[Smith数的定义是各位数字之和与它的各个质因数（可以重复）的各位数字之和的总和相同的数，且不是素数。
题目本身是一道水题，数据尤其水。
下面的代码中加了一个优化：
先将所有询问按询问的数字升序排序，处理某个询问A时，如果结果是B，那么对其后询问值小于B的所有询问，都直接
给出答案为B。
例如：
23
24
25
26
27
0
在处理23时得到58，由于后面四个数都小于5]]></description><category></category></item><item><title><![CDATA[ZOJ 1113 u Calculate e]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38642201</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38642201</guid><author>Lostwinder</author><pubDate>Sun, 17 Aug 2014 20:51:15 +0800</pubDate><description><![CDATA[纯水题。
时间：0毫秒。
#include
#include

using namespace std;

int main()
{
    double ans=1, temp=1;
    int i=0;
   
    cout<<"n e"<<endl;
    cout<<"- -----------"<<endl;
    cout<<i<<' '<<ans<<endl;
   ]]></description><category></category></item><item><title><![CDATA[ZOJ 1088 System Overload]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38642171</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38642171</guid><author>Lostwinder</author><pubDate>Sun, 17 Aug 2014 20:49:27 +0800</pubDate><description><![CDATA[典型的Joseph问题……
由于数据范围小，直接暴力就可以解决了……
用到了链表的数据结构……
时间：90毫秒。
#include "stdio.h"
#include "string.h"
struct lianbiao{
	int prev,next;
}p[152];
const int INF=2147483647;
void init(int n){
	int i;
	for(i]]></description><category></category></item><item><title><![CDATA[Codeforces 448D（动态规划、类H数）]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38045483</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38045483</guid><author>Lostwinder</author><pubDate>Tue, 22 Jul 2014 17:02:49 +0800</pubDate><description><![CDATA[这道题可以用类似H数（Humble Number）的方法做。
用一个数组f[1..n]记录]]></description><category></category></item><item><title><![CDATA[Codeforces 448A（简单计算）]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38045317</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38045317</guid><author>Lostwinder</author><pubDate>Tue, 22 Jul 2014 16:56:57 +0800</pubDate><description><![CDATA[水题。
#include "stdio.h"
#include "math.h"
int main(){
	int i,a1,a=0,b1,b=0,n,N;
	for(i=1;i<=3;i++){
		scanf("%d",&a1);
		a+=a1;
	}
	for(i=1;i<=3;i++){
		scanf("%d",&b1);
		b+=b1;
	}
	scanf("%d",&N);
	]]></description><category></category></item><item><title><![CDATA[Codeforces 448B （字符串简单处理，读题）]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38045369</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38045369</guid><author>Lostwinder</author><pubDate>Tue, 22 Jul 2014 16:56:36 +0800</pubDate><description><![CDATA[水题。
也要考虑到特殊情况：如t比s长的情况，直接need tree，不用]]></description><category></category></item><item><title><![CDATA[USACO 2.4.1 The Tamworth Two]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38020289</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38020289</guid><author>Lostwinder</author><pubDate>Mon, 21 Jul 2014 17:02:56 +0800</pubDate><description><![CDATA[模拟即可。
无解条件为F]]></description><category></category></item><item><title><![CDATA[USACO 2.3.2 Cow Pedigrees]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/38018407</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/38018407</guid><author>Lostwinder</author><pubDate>Mon, 21 Jul 2014 15:55:27 +0800</pubDate><description><![CDATA[标准DP题。
DP原理：对某一节点，]]></description><category></category></item><item><title><![CDATA[USACO 2.3.1 Longest Prefix]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/37994479</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/37994479</guid><author>Lostwinder</author><pubDate>Sun, 20 Jul 2014 17:32:16 +0800</pubDate><description><![CDATA[基本的动态规划吧。。想到方法了其实很简单（苯渣用暴搜做了2个小时，]]></description><category></category></item><item><title><![CDATA[USACO 2.3.3 Zero Sum]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/37990473</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/37990473</guid><author>Lostwinder</author><pubDate>Sun, 20 Jul 2014 11:40:50 +0800</pubDate><description><![CDATA[本题两种解法：
一、DFS。
二、三进制枚举。]]></description><category></category></item><item><title><![CDATA[USACO 2.3.4 Money Systems]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/37989461</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/37989461</guid><author>Lostwinder</author><pubDate>Sun, 20 Jul 2014 10:29:34 +0800</pubDate><description><![CDATA[这道题是整数拆分的变形。]]></description><category></category></item><item><title><![CDATA[USACO 2.2.4 Party Lamps]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/37956955</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/37956955</guid><author>Lostwinder</author><pubDate>Sat, 19 Jul 2014 10:32:52 +0800</pubDate><description><![CDATA[交了]]></description><category></category></item><item><title><![CDATA[USACO　2.2.2 Subset Sums]]></title><link>https://blog.youkuaiyun.com/Lostwinder/article/details/37930599</link><guid>https://blog.youkuaiyun.com/Lostwinder/article/details/37930599</guid><author>Lostwinder</author><pubDate>Fri, 18 Jul 2014 15:28:12 +0800</pubDate><description><![CDATA[题意为将1~n分割为和相等的两块。等价为]]></description><category></category></item></channel></rss>