2018年09月_破晓aa

原创求区间并集

#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 1010; struct node { int num; int pos; }sid[maxn];...

2018-09-29 09:15:51 1678

原创最长上升子序列（两种方法）

常规方法：（n^2) #include<iostream> using namespace std; int i,j,n,a[100],b[100],max; int main() { cin>>n; for(i=0;i<n;i++) cin>>a[i]; b[0]=1; //初始化，以a[0]结尾的最长递增...

2018-09-27 21:04:44 1934

原创 L - Vases and Flowers HDU - 4614（线段树）

Problem Description 　　Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers, she will try to put them in the vases, one...

2018-09-27 20:41:53 283

原创 K - Transformation HDU - 4578（线段树）

Yuanfang is puzzled with the question below: There are n integers, a 1, a 2, …, a n. The initial values of them are 0. There are four kinds of operations. Operation 1: Add c to each number between a x...

2018-09-27 20:32:28 442 5

原创约会安排 HDU - 4553

　寒假来了，又到了小明和女神们约会的季节。　　小明虽为屌丝级码农，但非常活跃，女神们常常在小明网上的大段发言后热情回复“呵呵”，所以，小明的最爱就是和女神们约会。与此同时，也有很多基友找他开黑，由于数量实在过于巨大，怎么安排时间便成了小明的一大心事。　　我们已知小明一共有T的空闲时间，期间会有很多女神或者基友来找小明。　　作为一个操作系统曾经怒考71分的大神，小明想到了一个算法，即“首次适应...

2018-09-27 20:26:14 341

原创 J - Assign the task HDU - 3974（线段树 + dfs序）

There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediate boss of someone,that ...

2018-09-24 14:54:32 318

原创 K - Transformation HDU - 4578(线段树）

Yuanfang is puzzled with the question below: There are n integers, a 1, a 2, …, a n. The initial values of them are 0. There are four kinds of operations. Operation 1: Add c to each number between a x...

2018-09-24 14:39:39 278

原创矩阵快速幂（ C - Recursive sequence HDU - 5950）

题干就不说了，直接上分析。此题的递推公式为 f [ n ] = f [ n - 1 ] + 2 * f [ n - 2 ] + n ^ 4，难点就在于构造转移矩阵，转移矩阵构造出来整个题目也就解决了，当然还要注意如果题目给的n小于3，直接输出就好了（在这个点栽了一发。。）构造转移矩阵的难点在于如何处理n的四次方这一部分。在此提供一个方法，凡是有n次幂的时候基本上都可以用。因为要保持...

2018-09-12 09:28:34 275

原创 Magical Girl Haze (分层图 + 最短路径优先队列优化）

There are NNN cities in the country, and MMM directional roads from uuu to v(1≤u,v≤n)v(1\le u, v\le n)v(1≤u,v≤n). Every road has a distance cic_ici. Haze is a Magical Girl that lives in City 111, she...

2018-09-03 21:16:32 374

日月