XieNaoban's Blog
0%

发表于 更新于 阅读次数： 评论次数：
本文字数： 2.3k 阅读时长 ≈ 2 分钟

想着把我CSDN上所有博客的markdown源文件备份一遍，但其实没学过这方面的东西，就做了个半成品。。。以后完善吧（应该） 实现了提取所有文章的名字与其对应文章ID和发布时间，并找到编辑文档的网页。 上面这些信息提取很方便，网页源码里翻就找得到。 然后按照文件名与日期给每一篇文章建立每一个空文件夹。 但是最关键的一步是，我不知道怎么提取每一篇.md文件。。。 渲染好的已经发布的文本我不要，我要.md源文件。只有编辑文本的时候遇得到md文件，所以就得实现模拟浏览器登陆。。。然而并不会做。。。 http://write.blog.csdn.net/post...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 2.5k 阅读时长 ≈ 2 分钟

Problem Description Given a sequence of numbers A=a1,a2,…,aN, a subsequence b1,b2,…,bk of A is referred as increasing if b1<b2<…<bk. LY has just learned how to find the longest increasing subsequence (LIS). Now that he has to select L consecutive numbers and remove them ...

发表于 更新于 分类于 阅读次数： 评论次数：
本文字数： 1.9k 阅读时长 ≈ 2 分钟

Problem Description 度度熊为了拯救可爱的公主，于是与邪恶大魔王战斗起来。 邪恶大魔王的麾下有n个怪兽，每个怪兽有a[i]的生命值，以及b[i]的防御力。 度度熊一共拥有m种攻击方式，第i种攻击方式，需要消耗k[i]的晶石，造成p[i]点伤害。 当然，如果度度熊使用第i个技能打在第j个怪兽上面的话，会使得第j个怪兽的生命值减少p[i]-b[j]，当然如果伤害小于防御，那么攻击就不会奏效。 如果怪兽的生命值降为0或以下，那么怪兽就会被消灭。 当然每个技能都可以使用无限次。 请问度度熊最少携带多少晶石，就可以消灭所有的怪兽。 Input 本...

发表于 更新于 阅读次数： 评论次数：
本文字数： 1.2k 阅读时长 ≈ 1 分钟

辣鸡Win10要折腾死我啊。一开始还以为硬件烧坏了。写下来方自己以后使用。 条件 win10一周年更新； SSD、HDD混合，SSD作为系统盘 BIOS的：AHCI、SATA、IDE模式：BIOS里面没找到这玩意。。。Acer宏碁VN7的笔记本，BIOS里面选项很少，仿佛很老旧的感觉。。。 设备管理器->IDE ATA/ATAPI 控制器驱动：标准 SATA AHCI 控制器。 症状 长时间挂机导致冻屏：比如启动了电脑而没有登陆，过一会回来登录界面就卡住了；又比如开着电脑出去了一趟，回来就卡住了。 卡住的症状：鼠标可以灵活的移动，鼠标移动到任务栏的...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 3.8k 阅读时长 ≈ 3 分钟

Description Misha and Grisha are funny boys, so they like to use new underground. The underground has n stations connected with n - 1 routes so that each route connects two stations, and it is possible to reach every station from any other. The boys decided to have fun and came u...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 4.4k 阅读时长 ≈ 4 分钟

Description Okabe likes to be able to walk through his city on a path lit by street lamps. That way, he doesn't get beaten up by schoolchildren. Okabe's city is represented by a 2D grid of cells. Rows are numbered from 1 to n from top to bottom, and columns are numbered 1 to mfro...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 3.6k 阅读时长 ≈ 3 分钟

Description Okabe likes to take walks but knows that spies from the Organization could be anywhere; that's why he wants to know how many different walks he can take in his city safely. Okabe's city can be represented as all points (x, y) such that x and y are non-negative. Okabe ...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 2.5k 阅读时长 ≈ 2 分钟

Desicription In a country, there are a number of cities. Each pair of city is connected by a highway, bi-directional of course. A road-inspector s task is to travel through the highways (in either direction) and to check if everything is in order. Now, a road-inspector has a list...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 1.1k 阅读时长 ≈ 1 分钟

Description Petr wants to make a calendar for current month. For this purpose he draws a table in which columns correspond to weeks (a week is seven consequent days from Monday to Sunday), rows correspond to weekdays, and cells contain dates. For example, a calendar for January 2...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 3.2k 阅读时长 ≈ 3 分钟

Description Santa Claus likes palindromes very much. There was his birthday recently. k of his friends came to him to congratulate him, and each of them presented to him a string si having the same length n. We denote the beauty of the i-th string by ai. It can happen that ai is ...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 2.1k 阅读时长 ≈ 2 分钟

PROBLEMSET里面神tm搜不到这题，很迷。所以标题就只好注明比赛出处而没法标明题号了。 Description You are an experienced Codeforces user. Today you found out that during your activity on Codeforces you have made y submissions, out of which x have been successful. Thus, your current success rate on Codeforces is equal ...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 3.2k 阅读时长 ≈ 3 分钟

千年两小时只写出2题，这次终于把C题写出来了。。。 Description On the way to school, Karen became fixated on the puzzle game on her phone! The game is played as follows. In each level, you have a grid with n rows and m columns. Each cell originally contains the number 0. One move consists of choosing one...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 3.6k 阅读时长 ≈ 3 分钟

Description To stay woke and attentive during classes, Karen needs some coffee! Karen, a coffee aficionado, wants to know the optimal temperature for brewing the perfect cup of coffee. Indeed, she has spent some time reading several recipe books, including the universally acclaim...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 2.9k 阅读时长 ≈ 3 分钟

最近刷题量大，不高兴写题解了。以后算竟的题目可能只是跳着做做了。 题目：6-11 UVa10410 - Tree Reconstruction 1234567891011121314151617181920212223242526272829303132333435363738394041424344//UVa10410 - Tree Reconstruction//Accepted 0.000s#include<iostream>#include<stack>#include<vector>using namespa...

发表于 更新于 分类于 ， 阅读次数： 评论次数：
本文字数： 2.9k 阅读时长 ≈ 3 分钟

哇咔咔，终于期末考完啦，终于放暑假啦，我终于又有时间学习啦！！(o゜▽゜)o☆ Description Vladik often travels by trains. He remembered some of his trips especially well and I would like to tell you about one of these trips: Vladik is at initial train station, and now n people (including Vladik) want to get on the tr...