<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lunaArcher的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lunaArcher</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lunaArcher]]></copyright><item><title><![CDATA[浙工大姗姗杯round3 A - 数塔 HDU - 2084]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75201105</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75201105</guid><author>lunaArcher</author><pubDate>Sun, 16 Jul 2017 13:44:06 +0800</pubDate><description><![CDATA[数塔
Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 44989    Accepted Submission(s): 26700



Problem Description

在讲述DP算法的时候，一个经典的例子就是数]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round2 G - Bad Luck Island CodeForces - 540D]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75200803</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75200803</guid><author>lunaArcher</author><pubDate>Sun, 16 Jul 2017 13:35:01 +0800</pubDate><description><![CDATA[D. Bad Luck Island


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



The Bad Luck Island is inhabited by thre]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round2 CodeForces 116B	Little Pigs and Wolves]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75195746</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75195746</guid><author>lunaArcher</author><pubDate>Sun, 16 Jul 2017 13:09:24 +0800</pubDate><description><![CDATA[B. Little Pigs and Wolves


time limit per test
 2 seconds


memory limit per test
 256 megabytes


input
 standard input


output
 standard output



Once upon a time there were s]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round1 G - A Mathematical Curiosity HDU - 1017]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75150918</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75150918</guid><author>lunaArcher</author><pubDate>Sun, 16 Jul 2017 09:26:17 +0800</pubDate><description><![CDATA[A Mathematical Curiosity
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 41840    Accepted Submission(s): 13449



Problem Description]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round2 CodeForces 103B	Cthulhu]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75193648</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75193648</guid><author>lunaArcher</author><pubDate>Sun, 16 Jul 2017 09:23:51 +0800</pubDate><description><![CDATA[B. Cthulhu


time limit per test
 2 seconds


memory limit per test
 256 megabytes


input
 standard input


output
 standard output



...Once upon a time a man came to the sea. T]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round1 F - Rikka with Parenthesis II]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75148107</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75148107</guid><author>lunaArcher</author><pubDate>Sat, 15 Jul 2017 11:21:26 +0800</pubDate><description><![CDATA[Rikka with Parenthesis II
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1545    Accepted Submission(s): 686



Problem Description

A]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round1 E - Generating Fast UVA - 10098]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75146792</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75146792</guid><author>lunaArcher</author><pubDate>Sat, 15 Jul 2017 11:05:47 +0800</pubDate><description><![CDATA[UVA - 10098 - Generating Fast



Generating permutation has always been an important problem in computer science. In this problem you will have to generate the permutation of a given string in asc]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round1 D - Well-known Numbers]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75145797</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75145797</guid><author>lunaArcher</author><pubDate>Sat, 15 Jul 2017 10:59:56 +0800</pubDate><description><![CDATA[B. Well-known Numbers


time limit per test
2 seconds


memory limit per test
256 megabytes


input
standard input


output
standard output



Numbers k-bonacci (k is
 integer, k ]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round1 C - Hello World! UVA - 11636]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75145641</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75145641</guid><author>lunaArcher</author><pubDate>Sat, 15 Jul 2017 10:50:49 +0800</pubDate><description><![CDATA[When you first made the computer to print the sentence “Hello World!”, you felt so happy, not knowing how complex and interesting the world of programming and algorithm will turn out to be. Then you d]]></description><category></category></item><item><title><![CDATA[浙工大姗姗杯round1 A - "Or" Game |CodeForces - 578B]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/75144676</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/75144676</guid><author>lunaArcher</author><pubDate>Sat, 15 Jul 2017 10:30:22 +0800</pubDate><description><![CDATA[A - "Or" Game
 CodeForces - 578B 



题意：给n个数，再给一个x，对n个数里任意几个进行总共为k次的an*x操作，要求这n个数最后“OR”（或）结果最大。
思路：有个坑点，一开始以为乘以最大的数就可以了，果然没那么简单。借别人一个反例比如 
1 0 0 0 
1 0 1 1 
1 1 0 1 
这3个数字; 
假设要乘的数字x是2；只能乘1]]></description><category></category></item><item><title><![CDATA[Dancing link ZOJ3209]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/70228011</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/70228011</guid><author>lunaArcher</author><pubDate>Tue, 18 Apr 2017 14:23:24 +0800</pubDate><description><![CDATA[Dancing link外面的模板其实都是错的。。看了我一天纠错，其实就是link函数的D，U，L，R（上下左右）全部弄反了，不影响结果，但是会让人无法理解。另外不明白为什么非要建个结构体？？
#include 
#include 
using namespace std;
int n, m, p, x1, y1, x2, y2;
int shang[101000], xia[101000],]]></description><category></category></item><item><title><![CDATA[天梯赛L2-016愿天下有情人都是失散多年的兄妹]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/68491481</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/68491481</guid><author>lunaArcher</author><pubDate>Thu, 30 Mar 2017 19:03:34 +0800</pubDate><description><![CDATA[pat并查集题目太多了。这道就用了dfs写。其实用bfs+set去重写更简单，在下比较辣鸡吧
#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
int a, b, N, d;
char c;
struct person {
	char sex;
	int papa, mama;
}Lu]]></description><category></category></item><item><title><![CDATA[51nod没过的那题]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/62448211</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/62448211</guid><author>lunaArcher</author><pubDate>Thu, 16 Mar 2017 22:05:30 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
using namespace std;
map > Lu;
int a[100001], b[100001];
int main(){
    int n;
    while(cin >> n){
        int x = n;
        for(int i = 1; i <= n; i++){
            c]]></description><category></category></item><item><title><![CDATA[省赛Colorful Rainbows]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/60869181</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/60869181</guid><author>lunaArcher</author><pubDate>Wed, 08 Mar 2017 11:25:20 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
struct straight{
    double a, b;
}Lu[6000], Hui[6000];
bool cmp(straight x, straight y){
    if(x.a != y.a)
        return x.a <]]></description><category></category></item><item><title><![CDATA[prim算法学习]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/60765067</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/60765067</guid><author>lunaArcher</author><pubDate>Tue, 07 Mar 2017 15:08:56 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
using namespace std;
#define INF 10000000
int N, E;
int sum;
int town[600][1000];
void prim(){
    int dis[1000], vis[1000], now = 0, Min;
    sum = 0;
    mems]]></description><category></category></item><item><title><![CDATA[浙江第四届省赛第一题]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/58641638</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/58641638</guid><author>lunaArcher</author><pubDate>Tue, 28 Feb 2017 20:21:47 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
using namespace std;
#define inf 10000000
int n, m;
int dir[4][2] = {0, -1, 0, 1, 1, 0, -1, 0};
int ans[5000000 + 5];
int mp[1000 + 5][1000 + 5];
type]]></description><category></category></item><item><title><![CDATA[dp矩阵连乘]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/57406285</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/57406285</guid><author>lunaArcher</author><pubDate>Sun, 26 Feb 2017 11:43:27 +0800</pubDate><description><![CDATA[#define NUM 51
int p[NUM];//p[0],p[1]代表第一个矩阵，剩下只需记录矩阵的列数，因为下一个矩阵的行数都等于上一个矩阵的列数
int m[NUM][NUM];
int s[NUM][NUM];
void MatrixChain (int n)
{
	for (int i = 1; i <= n; i++) m[i][i] = 0;
	for (int r = 2;]]></description><category></category></item><item><title><![CDATA[迪加斯特拉]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/57087798</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/57087798</guid><author>lunaArcher</author><pubDate>Sat, 25 Feb 2017 18:31:09 +0800</pubDate><description><![CDATA[#define NUM 100
#define maxint 10000
//顶点个数n，源点v，有向图的邻接矩阵为c
//数组dist保存从源点v到每个顶点的最短特殊路径长度
//数组prev保存每个顶点在最短特殊路径上的前一个结点
void dijkstra(int n, int v, int dist[], int prev[], int c[][NUM])
{
	int i, j;
	bo]]></description><category></category></item><item><title><![CDATA[HDU 1800]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/56278482</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/56278482</guid><author>lunaArcher</author><pubDate>Tue, 21 Feb 2017 11:14:50 +0800</pubDate><description><![CDATA[代码wa了。先放着等以后找问题#include 
#include 
#include 
#include 
using namespace std;
struct Node {
	int num;
	Node *Lu[10];
	Node() {
		num = 0;
		for (int i = 0; i < 10; i++)
			Lu[i] = NULL;
	}
};
int n;
Nod]]></description><category></category></item><item><title><![CDATA[浙工大15新生决赛 改造字符串]]></title><link>https://blog.youkuaiyun.com/lunaArcher/article/details/53713483</link><guid>https://blog.youkuaiyun.com/lunaArcher/article/details/53713483</guid><author>lunaArcher</author><pubDate>Sat, 17 Dec 2016 21:14:00 +0800</pubDate><description><![CDATA[#include 
#include 
using namespace std;
int main() {
	string Lu, Hui;
	Hui = "QunHe";
	while (cin >> Lu && EOF) {
		int n = Lu.length() - 1;
		int flag = 1;
		if (Lu[0] != 'Q' && Lu[n] != 'e') {
			p]]></description><category></category></item></channel></rss>