<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[謎のかれ]]></title><description><![CDATA[......]]></description><link>https://blog.youkuaiyun.com/Ljp136174298</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Ljp136174298]]></copyright><item><title><![CDATA[kmp]]></title><link>https://blog.youkuaiyun.com/Ljp136174298/article/details/8480650</link><guid>https://blog.youkuaiyun.com/Ljp136174298/article/details/8480650</guid><author>Ljp136174298</author><pubDate>Tue, 08 Jan 2013 13:16:04 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
void get(char *d,int *next)
{
    int i,j;
    i=1;j=0;
    next[1]=0;

    while(i<b)
    {
        if(j==0||d[i]==d[j])
        {
            ++i;+]]></description><category></category></item><item><title><![CDATA[kmp]]></title><link>https://blog.youkuaiyun.com/Ljp136174298/article/details/8480645</link><guid>https://blog.youkuaiyun.com/Ljp136174298/article/details/8480645</guid><author>Ljp136174298</author><pubDate>Tue, 08 Jan 2013 13:15:17 +0800</pubDate><description><![CDATA[#include #include #include using namespace std;void get(char *d,int *next){ int i,j; i=1;j=0; next[1]=0; while(i<b) { if(j==0||d[i]==d[j]) { ++i;++j; next[i]=j; } else j=next[j]; } /*for(int q=1;q<=b;]]></description><category></category></item><item><title><![CDATA[珠子什么的最讨厌了。。]]></title><link>https://blog.youkuaiyun.com/Ljp136174298/article/details/8041934</link><guid>https://blog.youkuaiyun.com/Ljp136174298/article/details/8041934</guid><author>Ljp136174298</author><pubDate>Fri, 05 Oct 2012 20:51:24 +0800</pubDate><description><![CDATA[珠子






Time Limit 1000ms


Memory Limit 65536K





description
小林有一串珠子，是由很多个大小不同的珠子串联在一起组成的圆环型的，且其中每个珠子的大小可以用int型的整数来表示。小林有一个爱好就是数珠子，他想数那些位置相邻而且大小只相差1的珠子组成单调递增或单调递减的最长串是多长，比如说现在他有5]]></description><category></category></item><item><title><![CDATA[C语言字符串函数大全]]></title><link>https://blog.youkuaiyun.com/Ljp136174298/article/details/8039563</link><guid>https://blog.youkuaiyun.com/Ljp136174298/article/details/8039563</guid><author>Ljp136174298</author><pubDate>Thu, 04 Oct 2012 14:47:20 +0800</pubDate><description><![CDATA[函数名: strcpy

功 能: 拷贝一个字符串到另一个

用 法:
 char *stpcpy(char *destin, char *source);

程序例:

 

#include 

#include 

 

int main(void)

{

   char string[10];

   char *str1 = "abcdef]]></description><category></category></item><item><title><![CDATA[林大378]]></title><link>https://blog.youkuaiyun.com/Ljp136174298/article/details/8029266</link><guid>https://blog.youkuaiyun.com/Ljp136174298/article/details/8029266</guid><author>Ljp136174298</author><pubDate>Fri, 28 Sep 2012 17:03:49 +0800</pubDate><description><![CDATA[点击打开链接
#include 
#include 
#include 
using namespace std;
int main(int argc, char *argv[])
{
    int a,b,t,add=-1;
     while(~scanf("%d",&a))
        {  int test[a];
           for(int i=0;i<a;i++)]]></description><category></category></item></channel></rss>