<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Gloria971111的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Gloria971111</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Gloria971111]]></copyright><item><title><![CDATA[bjfu_data_structure考点整理]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/100664732</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/100664732</guid><author>Gloria971111</author><pubDate>Mon, 09 Sep 2019 21:09:12 +0800</pubDate><description><![CDATA[9.9
第2章 线性表
1.顺序表：定义、查找、插入和删除算法（算法设计）
2.链表：定义、查找、插入和删除算法（算法设计）
3.循环链表、双向链表的特点，插入和删除代码（选择填空）
4.顺序表链表对比、使用场合（选择填空）
5.线性表的合并算法（算法设计）
第3章 栈和队列
1.栈：顺序栈、链栈的定义、栈满栈空条件、查找、插入和删除算法（选择填空）
2.队列：循环队列、链队的定义、队满队空条件、...]]></description><category></category></item><item><title><![CDATA[PTA刷题记录]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/99446353</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/99446353</guid><author>Gloria971111</author><pubDate>Tue, 13 Aug 2019 16:35:27 +0800</pubDate><description><![CDATA[9.8号考试，需要刷完155道题！
记录不会做的题 &amp; 学到的算法 &amp; 一些比较trick的技巧
8.13
1013 Battle Over Cities
题目大意：n个城市，m条道路，k个询问，每次询问时有一个城市被敌军占领，不可通过，问此时需要修几条路可以保证剩余城市彼此之间可达。
用并查集做超时了…

...]]></description><category></category></item><item><title><![CDATA[deeplabV3+运行及训练自己的数据集总结]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/95596301</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/95596301</guid><author>Gloria971111</author><pubDate>Fri, 12 Jul 2019 10:45:02 +0800</pubDate><description><![CDATA[windows上运行：
https://www.jianshu.com/p/1a07990705ee
Ubuntu可以相应的修改bat到sh即可
训练自己的数据集：
https://blog.youkuaiyun.com/Kelvin_XX/article/details/81946091
因为是在预训练模型上继续训练的，所以会有图像分割种类的问题，需要在train的时候做一点参数调整：
https://bl...]]></description><category></category></item><item><title><![CDATA[codeforces 1037D- Valid BFS?]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/82351410</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/82351410</guid><author>Gloria971111</author><pubDate>Mon, 03 Sep 2018 17:05:01 +0800</pubDate><description><![CDATA[#include&amp;lt;bits/stdc++.h&amp;gt;
#include&amp;lt;vector&amp;gt;
#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;queue&amp;gt;

int n;

typedef struct Point
{
    int num;
    int father;
    vector&amp;lt;int&amp;...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2018 南京赛区网络预赛-L题（分层图最短路）]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/82316669</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/82316669</guid><author>Gloria971111</author><pubDate>Sun, 02 Sep 2018 16:36:21 +0800</pubDate><description><![CDATA[哎呀这个图论是真的辣鸡啊… 
题意：n个城市（N≤100000），m条单向路（M≤200000），过路是要有花费的，可以将k（k≤10）条路的花费变为0，求从1-n的最短路。

这个题目就是分层图最短路，把图拆成k+1层，然后每个点拆成k+1个点，这样就有1e6个点，对着1e6个点进行最短路的计算，堆优化的Dijkstra，O（m+n）logn，大概是1e7的时间复杂度是可以过的！

我们把每个点...]]></description><category></category></item><item><title><![CDATA[ACM-ICPC 2018 南京赛区网络预赛-E题（状压dp）]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/82314830</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/82314830</guid><author>Gloria971111</author><pubDate>Sun, 02 Sep 2018 13:33:55 +0800</pubDate><description><![CDATA[#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;string.h&amp;gt;

int n;
int a[25];
int b[25];
int limit[25];
int yilai[25];
int bin[25];
long long dp[2000005];
int tot...]]></description><category></category></item><item><title><![CDATA[CNN理解]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81563358</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81563358</guid><author>Gloria971111</author><pubDate>Fri, 10 Aug 2018 14:53:32 +0800</pubDate><description><![CDATA[ 
卷积神经网络 
深度学习就是代价函数，]]></description><category></category></item><item><title><![CDATA[hdu6370]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81516896</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81516896</guid><author>Gloria971111</author><pubDate>Wed, 08 Aug 2018 22:39:33 +0800</pubDate><description><![CDATA[WA到崩溃，明天再说吧

#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;vector&amp;gt;

int n;
typedef struct Point
{
    int father;
    int initfather;
    int son;
    int talkpoint;
    int good;
};

P...]]></description><category></category></item><item><title><![CDATA[hdu3368]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81483677</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81483677</guid><author>Gloria971111</author><pubDate>Tue, 07 Aug 2018 16:28:19 +0800</pubDate><description><![CDATA[#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;math.h&amp;gt;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;algorithm&amp;gt;

int n,q;
int num[100005];
int dp[100005][20];
int f[100005];

void init()
{
   ...]]></description><category></category></item><item><title><![CDATA[poj3264 RMQ+ST裸题]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81482394</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81482394</guid><author>Gloria971111</author><pubDate>Tue, 07 Aug 2018 15:38:41 +0800</pubDate><description><![CDATA[区间查询最大值最小值，ST算法：O(nlogn)初始化+O(1)查询

#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;math.h&amp;gt;

int N,Q;
int height[50005];
int dpmax[50005][20];//从第i个数起长度为2^j的区间内的...]]></description><category></category></item><item><title><![CDATA[hdu6231]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81479523</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81479523</guid><author>Gloria971111</author><pubDate>Tue, 07 Aug 2018 13:17:34 +0800</pubDate><description><![CDATA[#include&amp;amp;lt;iostream&amp;amp;gt;
using namespace std;
#include&amp;amp;lt;string.h&amp;amp;gt;

int dp[2][1025];//当前操作后，dp[i][j]表示j状态下的点已经匹配 
int b[15];
int cnt[1025];
const int mod=1e9+7;
int ans[10];

void init_b()
{
    b...]]></description><category></category></item><item><title><![CDATA[hdu6352]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81464108</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81464108</guid><author>Gloria971111</author><pubDate>Tue, 07 Aug 2018 00:33:40 +0800</pubDate><description><![CDATA[#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;string.h&amp;gt;
#include&amp;lt;vector&amp;gt;

char num[15];
int k;
char maxnum[15];
char minnum[15];
char tempnum[15];
int n;

void swap(char &amp;amp;a,ch...]]></description><category></category></item><item><title><![CDATA[TensorFlow学习（六）卷积神经网络CNN、循环（递归）神经网络RNN]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81357325</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81357325</guid><author>Gloria971111</author><pubDate>Thu, 02 Aug 2018 13:38:07 +0800</pubDate><description><![CDATA[1.传统神经网络存在的问题 
权值太多，计算量太大； 
权值太多，需要大量样本进行训练；

经验之谈：训练数据是未知量的5到30倍 
2.局部感受野]]></description><category></category></item><item><title><![CDATA[TensorFlow学习（五）mnist简单实现模型+tensorboard]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81356837</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81356837</guid><author>Gloria971111</author><pubDate>Thu, 02 Aug 2018 12:45:59 +0800</pubDate><description><![CDATA[一、简单模型

import tensorflow as tf
from tensorflow.examples.tutorials.mnist import input_data

#载入数据集
mnist=input_data.read_data_sets('D:\\ATest\\MNIST_data',one_hot=True)
#每个批次的大小
batch_size=100
#计算一共有多...]]></description><category></category></item><item><title><![CDATA[TensorFlow学习（四）代价函数、拟合、优化器]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81322850</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81322850</guid><author>Gloria971111</author><pubDate>Tue, 31 Jul 2018 23:49:57 +0800</pubDate><description><![CDATA[二次代价函数 
 
相当于把误差求平方累加再除以样本总数，求平均 
]]></description><category></category></item><item><title><![CDATA[TensorFlow学习（三）简单回归模型-抛物线]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81322573</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81322573</guid><author>Gloria971111</author><pubDate>Tue, 31 Jul 2018 23:19:32 +0800</pubDate><description><![CDATA[import tensorflow as tf
import numpy as np
import matplotlib.pyplot as plt

#使用numpy生成200个随机点
x_data=np.linspace(-0.5,0.5,200)[:,np.newaxis]
noise=np.random.normal(0,0.02,x_data.shape)
y_data=np.squar...]]></description><category></category></item><item><title><![CDATA[TensorFlow学习（二）简单线性模型+梯度下降法优化]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81318764</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81318764</guid><author>Gloria971111</author><pubDate>Tue, 31 Jul 2018 19:04:12 +0800</pubDate><description><![CDATA[import tensorflow as tf
import numpy as ny

#使用numpy生成100个点
x_data=ny.random.rand(100)
y_data=0.1*x_data+0.2

#构造一个线性模型
k=tf.Variable(1.1)
b=tf.Variable(0.5)
y=k*x_data+b

#二次代价函数
loss=tf.reduce_mean(...]]></description><category></category></item><item><title><![CDATA[TensorFlow学习（一）基本概念+变量]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/81318751</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/81318751</guid><author>Gloria971111</author><pubDate>Tue, 31 Jul 2018 19:02:35 +0800</pubDate><description><![CDATA[一：基本概念 
TensorFlow是一个编程系统，利用图来表示计算任务，图中的节点称之为op（operation），一个op获得一个或者多个tensor（数据），执行运算产生一个或者多个tensor。tensor看做一个n维的数组或者列表。图必须在会话（session）中被启动。 
二：一些基础操作 
（一）定义一个op

import tensorflow as tf
m1=tf.consta...]]></description><category></category></item><item><title><![CDATA[hdu1087]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/79931964</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/79931964</guid><author>Gloria971111</author><pubDate>Fri, 13 Apr 2018 17:18:56 +0800</pubDate><description><![CDATA[#渣渣的自我救赎# 
最大上升子序列和



#include&amp;lt;iostream&amp;gt;
using namespace std;
#include&amp;lt;string.h&amp;gt;

int num[1000010];
int maxnum[1000010];


int main()
{
    int n;
    while(scanf(&quot;%d&quot;,&amp;amp;n)!=EOF&amp;amp;&amp;a...]]></description><category></category></item><item><title><![CDATA[hdu1003]]></title><link>https://blog.youkuaiyun.com/Gloria971111/article/details/79929596</link><guid>https://blog.youkuaiyun.com/Gloria971111/article/details/79929596</guid><author>Gloria971111</author><pubDate>Fri, 13 Apr 2018 15:28:54 +0800</pubDate><description><![CDATA[#渣渣的自我救赎# 
 最大连续子序列和（dp经典问题最长上升子序列、最长公共子序列） 
 这个题目就是一串数字，找出最大连续子序列和。 
 dp的三个特性最优子结构性质、子问题重叠性质、无后效性 
 状态转移方程dp[i]=max(dp[i-1]+num[i],num[i])



#include&amp;lt;iostream&amp;gt;
using namespace std;

int num[10...]]></description><category></category></item></channel></rss>