poursoul

传送门：【ZOJ】2770 Burn the Linked Camp 题目分析： 这题差分约束相对简单了不少啊。 gen j

传送门：【HDU】1245 Saving James Bond

传送门：【HDU】5025 Saving Tang Monk 题目分析：这题一开始

传送门：【HDU】1690 Bus System

传送门：【HDU】2433 Travel

传送门：【POJ】2472 106 miles to Chicago 题目分析：

传送门：【POJ】1797 Heavy Transportation 题目分析：二分

传送门：【POJ】1949 Chores

传送门：【POJ】1502 MPI Maelstrom 题目分析：英语捉急了，题目超级简单。。

传送门：【POJ】1724 ROADS chu

传送门：【POJ】1734 Sightseeing trip

传送门：【HDU】1384 Intervals 题目分析：cha fen

传送门：【HDU】1531 King 题目分析：差分约束！

传送门：【HDU】1529 Cashier Employment 题目分析：想不出建图。。蒟蒻zhi nen

传送门：【HDU】3768 Shopping

传送门：【HDU】4871 Shortest-path tree 题目分析：

传送门：【HDU】1534 Schedule Problem

传送门：【POJ】1556 The Doors 题目分析：状态太差了。。这题hua le

传送门：【HDU】3986 Harry Potter and the Final Battle

传送门：【HDU】1598 find the most comfortable road

传送门：【HDU】2807 The Shortest Path 题目分析：

传送门：【HDU】2363 Cycling

传送门：【ACdream】1215 Get Out!

传送门：【SGU】103. Traffic Lights 题mu

题目链接：Ice Walls#include <bits/stdc++.h> using namespace std ;typedef long long LL ; typedef pair < double , int > pii ;#define clr( a , x ) memset ( a , x , sizeof a )const int MAXN = 1005 ; const doubl

题目链接：Subsequence吐槽，先是对着定义yy了可持久化二项堆，然后发现不好搞这个k短路，然后找了左偏树的定义，对着yy了20分钟写出了可持久化左偏树，然后过了poj2449后就1A了这个题。#include <stdio.h> #include <vector> #include <queue> #include <algorithm> using namespace std ;typed

题目链接：Remmarguts’ Datek短路模板题，用这题验证了我可持久化左偏树的正确性。#include <stdio.h> #include <vector> #include <queue> #include <algorithm> using namespace std ;typedef long long LL ; typedef pair < int , int > pii ; ty

题目链接：A1228. 飞飞侠#include <bits/stdc++.h> using namespace std ;typedef long long LL ;#define clr( a , x ) memset ( a , x , sizeof a )const int MAXN = 155 ; const LL INF = 1e18 ;struct Node { LL dis ;

Countries in War Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2236 Accepted: 698 Description In the year 2050, after different attem

Animals are living their painful lives in the zoo. Their activitiesare limited in a small area without any fun of snacks, alcohol, loveor games. They are so upset that they decide to escape in a night

传送门：【Codeforces】449B Jzzhu and Cities ti mu da y

传送门：【HDU】4725 The Shortest Path in Nya Graph 题目大意：

Problem C: A Walk Through the Forest Jimmy experiences a lot of stress at work these days, especially sincehis accident made working difficult. To relax after a hard day, helikes to walk home. To

ProblemD: Airport Express In a small city called Iokh, a train service, Airport-Express, takes residents to the airport more quickly than other transports. There are two types of trains in Airpor

Toll! Revisited Input: Standard Input Output: Standard Output Time Limit: 1 Second   Sindbad the Sailor sold 66 silver spoons to the Sultan ofSamarkand. The selling was quite easy; but deliverin

Sightseeing Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 6951   Accepted: 2478 Description Tour operator Your Personal Holiday organises guided bus trips

It's not a Bug, It's a Feature! Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 160    Accepted Submission(s): 80 Problem Description

Greedy Driver Time Limit: 2 Seconds      Memory Limit: 65536 KB Edward is a truck driver of a big company. His daily work is driving a truck from one city to another. Recently he got a long d

传送门：【HDU】4885 TIANKENG’s travel 题目分析： 这题的数据太弱了吧 - -||

传送门：【HDU】3035 War