<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[u014236804的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/u014236804</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; u014236804]]></copyright><item><title><![CDATA[32]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/53744985</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/53744985</guid><author>u014236804</author><pubDate>Mon, 19 Dec 2016 17:48:08 +0800</pubDate><description><![CDATA[23]]></description><category></category></item><item><title><![CDATA[java基础-使用Arrays管理数组排序，复制，查找，填充]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/51953311</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/51953311</guid><author>u014236804</author><pubDate>Tue, 19 Jul 2016 10:59:17 +0800</pubDate><description><![CDATA[//Array.copyOf(int a[]@1,int newLength@2);1是原数组2新数组的长度
	//Array.copyOfRange(int a[]@1,int form@2,int to@3);1是原数组2复制开始的位置3复制结束的位置
	//System.arraycopy(objiect src@1,int@2 srcPos@3,Object dest@4,int dest]]></description><category></category></item><item><title><![CDATA[lower_bound()&&upper_bound()得用法]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/41082207</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/41082207</guid><author>u014236804</author><pubDate>Thu, 13 Nov 2014 17:30:52 +0800</pubDate><description><![CDATA[lower_bound()在整个前闭后开区间查找]]></description><category></category></item><item><title><![CDATA[LA3942]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/39048999</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/39048999</guid><author>u014236804</author><pubDate>Thu, 04 Sep 2014 10:27:41 +0800</pubDate><description><![CDATA[#include
#include
using namespace std;
const int mode = 20071027;
const int maxn = 310000;
char str[maxn];
int dp[maxn];
char a[110];
struct node
{
    int next[26];
    int f;
} T[4000*100];
int tot;]]></description><category></category></item><item><title><![CDATA[LA4329]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/39029997</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/39029997</guid><author>u014236804</author><pubDate>Wed, 03 Sep 2014 17:04:58 +0800</pubDate><description><![CDATA[﻿﻿
N (3 N 20000) ping pong players live along a west-east street(consider the street as a line segment). Each
player has a unique skill rank. To improve their skill rank, they often compete with eac]]></description><category></category></item><item><title><![CDATA[c++函数模板，有默认参数的函数]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38821169</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38821169</guid><author>u014236804</author><pubDate>Mon, 25 Aug 2014 15:38:11 +0800</pubDate><description><![CDATA[#include 
using namespace std;
template 
//template两个都行
T max(T a,T b,T c)
{
    if(b>a) a=b;
    if(c>a) a=c;
    return a;
}

int main()
{
    int i1=185,i2=-76,i3=567,i;
    double d1=56.87,d2=-90.]]></description><category></category></item><item><title><![CDATA[c++函数]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38820425</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38820425</guid><author>u014236804</author><pubDate>Mon, 25 Aug 2014 15:15:09 +0800</pubDate><description><![CDATA[1.内置函数


inline]]></description><category></category></item><item><title><![CDATA[C++控制符，操纵符]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38817435</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38817435</guid><author>u014236804</author><pubDate>Mon, 25 Aug 2014 14:45:04 +0800</pubDate><description><![CDATA[dec   10进制
hex   16
oct]]></description><category></category></item><item><title><![CDATA[c++class(类）]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38817017</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38817017</guid><author>u014236804</author><pubDate>Mon, 25 Aug 2014 10:07:54 +0800</pubDate><description><![CDATA[1初始c++类class]]></description><category></category></item><item><title><![CDATA[C文件]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38798047</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38798047</guid><author>u014236804</author><pubDate>Sun, 24 Aug 2014 18:56:51 +0800</pubDate><description><![CDATA[﻿﻿
#include
#define SIZE 10
struct student_type
{
    char name[10];
    int num;
    int age;
    char addr[15];
}stud[SIZE];
void save()
{
    FILE *fp;
    int i;
    if((fp=fopen("st]]></description><category></category></item><item><title><![CDATA[c枚举类型]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38776269</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38776269</guid><author>u014236804</author><pubDate>Sat, 23 Aug 2014 10:47:19 +0800</pubDate><description><![CDATA[//枚举变量声明


enum  Weekday {sum,mon,tue,]]></description><category></category></item><item><title><![CDATA[共用体]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38775777</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38775777</guid><author>u014236804</author><pubDate>Sat, 23 Aug 2014 09:09:43 +0800</pubDate><description><![CDATA[﻿﻿
//共用体变量
//申明
union data
{
    int i;
    char ch;
    double f;
}a,b,c;
union data a,b,c;
union
{
    int i;
    char ch;
    double f;
}a,b,c;

//只能引用成员不能引用本身
//初始化

a={16};
a]]></description><category></category></item><item><title><![CDATA[c指针]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38731551</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38731551</guid><author>u014236804</author><pubDate>Fri, 22 Aug 2014 10:54:24 +0800</pubDate><description><![CDATA[1  指向函数的指针


int（*o]]></description><category></category></item><item><title><![CDATA[c动态内存分配]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38752159</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38752159</guid><author>u014236804</author><pubDate>Fri, 22 Aug 2014 10:45:28 +0800</pubDate><description><![CDATA[1.void *malloc(unsigned size int)
int *p;
p=(int *)malloc(n*]]></description><category></category></item><item><title><![CDATA[数字的输出]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38730581</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38730581</guid><author>u014236804</author><pubDate>Thu, 21 Aug 2014 15:24:15 +0800</pubDate><description><![CDATA[1.指定宽度和小数位数（%m.nf）
m宽度
n小数位数]]></description><category></category></item><item><title><![CDATA[c语言字符处处理函数]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38730177</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38730177</guid><author>u014236804</author><pubDate>Thu, 21 Aug 2014 15:20:57 +0800</pubDate><description><![CDATA[strcat——字符串连接函数
strcat（]]></description><category></category></item><item><title><![CDATA[树状数组，二查索引树，BIT]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38726671</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38726671</guid><author>u014236804</author><pubDate>Thu, 21 Aug 2014 15:03:46 +0800</pubDate><description><![CDATA[//预处理
//c[i]=a[i-lowbit(i)+1]+......a[i];

for(int i=1;i<=n;i++)
    for(int j=i-lowbit(i)+1;j<=i;j++)
    c[i]+=a[j];

//求和

int sum(int x)
{
    int ret=0;
    while(x>0)
    {
        ret+=c[x];
  ]]></description><category></category></item><item><title><![CDATA[uva(10344)]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38702225</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38702225</guid><author>u014236804</author><pubDate>Wed, 20 Aug 2014 10:05:00 +0800</pubDate><description><![CDATA[#include 
#include
#include

using namespace std;
int a[6],A[6],flag,vis[6],v[6];
char b[]= {"*-+"},B[6];

void dfs1(int cur)
{
    int t;
    if(flag) return ;
    else if(cur==5)
    {
        t=A[0]]></description><category></category></item><item><title><![CDATA[uva146（排序）]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38610881</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38610881</guid><author>u014236804</author><pubDate>Sat, 16 Aug 2014 10:19:45 +0800</pubDate><description><![CDATA[http://vjudge.net/vjudge/problem/viewProblem.action?id=19158





ID Codes




Time Limit: 3000MS
 
Memory Limit: Unknown
 
64bit IO Format: %lld & %llu





[Submit]  
 [Go Back]]></description><category></category></item><item><title><![CDATA[子集生成]]></title><link>https://blog.youkuaiyun.com/u014236804/article/details/38582065</link><guid>https://blog.youkuaiyun.com/u014236804/article/details/38582065</guid><author>u014236804</author><pubDate>Fri, 15 Aug 2014 11:02:44 +0800</pubDate><description><![CDATA[/*
//方法一：
//思路：构造一个位向量visit，而不是直接构造子集A本身
#include
using namespace std;
 
void fun(int *visit, int cur, int n)
{
    if(cur == n+1)
    {
        for(int i = 1;i <= n;++ i)
            if(visit[i])
   ]]></description><category></category></item></channel></rss>