Others

= "Adobecodebanc"= "ABC""BANC"return the emtpy string "". If There is multiple such windows, you is guaranteed that there would always being only one unique minimum window in S.Difficulty: There are a lot of problems in the string problem is not

Title Description : http://poj.org/problem?id=2823Ideas:To find the maximum and minimum values for an interval, you can use two monotone queues, consider using a double-ended queue because you need to delete elements before the queue and add

Http://home.fang.com/ask/14370/ Http://home.fang.com/ask/14371/ Http://home.fang.com/ask/14372/ Http://home.fang.com/ask/14373/ Http://home.fang.com/ask/14374/ Http://home.fang.com/ask/14375/ Http://home.fang.com/ask/14376/

Question link: http://poj.org/problem? Id = 2231  Ideas: Sort and then derive the formula. Code: # Include # include using namespace STD; int main () {long int ans = 0, arr [10010]; int n, m; cin> N; For (INT I = 0; I arr [I];} Sort (ARR, arr

I hate ittime limit: 9000/3000 MS (Java/others) memory limit: 32768/32768 K (Java/others) total submission (s): 39959 accepted submission (s): 15863 Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1754 Problem description Many

Programmers love big tricks, and the nickname is accumulation and accumulation. Sometimes, you can call it a "scholar". Of course, you can call it a "scholar ". One way for programmers to make a big move is to "read books". For example, I have two

Descriptionthere are n cities and N-1 roads in magic-island. you can go from one city to any other. one road only connects two cities. one day, the king of magic-island want to visit the island from the capital. no road is visited twice. do you know

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 5058 Question: Given two sets, the two sets have n elements, and determine whether the two sets are equal. For example: A set = {5, 3, 7, 7}, B set = {7, 5, 3}, then a set is equal to B set, Because

Vim/etc/sysconfig/network-scripts/ifcfg-eth0 Service Network restart Umount/dev/CDROM Mount/dev/Drom/mnt CD/mnt/Server/ Rpm-IVH dhcp-3.0.5-23.el5.i386.rpm Rpm-IVH dhcp-devel-3.0.5-23.el5.i386.rpm Rpm-IVH xinetd-2.3.14-10.el5.i386.rpm Rpm-IVH

Tree link splitting Basics #include #include #include using namespace std;const int maxn = 10010;struct edge{int v, next;}e[maxn*2];int first[maxn], cnt;int top[maxn], dep[maxn], sz[maxn], f[maxn], son[maxn], rank[maxn], tid[maxn];int tp, tim;int d[

I haven't written network stream for a long time ...... At first, I thought it was DP. I didn't think of it. I found it was a network stream. The diagram is quite interesting. Divide the service personnel into N points, and each point is connected

War Time Limit: 8000/5000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 81 accepted submission (s): 23Special Judge Problem descriptionlong long ago there are two countrys in the universe. each country haves its

In the course of work, in order to monitor the status, it is often necessary to repeatedly execute a command, so write a script to simplify the operation #! /Bin/bash # filename: redo. sh # usage: redo. sh [-D delaytime] [-c count] command # The

This document records a simple FFMPEG-based streamer (simplest FFMPEG streamer ). The streamer is used to push local video data to the Streaming Media Server. The streamer recorded in this article can use streaming media protocols (such as rtmp,

Grouping tree questions ..... The famous ICPC team again Time Limit: 30000/15000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 859 accepted submission (s): 415 Problem descriptionwhen mr. b, mr. G and Mr. m were

Threadpoolexecutor is a very important class used to buildTask executorTo construct a thread pool with different specifications by configuring different parameters.Task executor. The preface is: Thread PoolAndTask executorThe thread pool

Enemy army deployment Time limit:1000 ms Memory limit:32768kb 64bit Io format:% I64d & % i64usubmit status Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1166 DescriptionCountry C's rival Country A is conducting military

Map map = new hashmap (); map. put ("key1", "value1"); map. put ("key2", "value2"); map. put ("key3", "value3"); // the first type is commonly used. The second value is system. out. println ("through map. keyset traversal key and value: "); For

The program is to generate a 10x10 character array, and the initialization is all a random footwork. The program must randomly move from one element to the other, and move only one element position up, down, left or right at a time. The accessed

Since the beginning of the expansion, I have been thinking about a stable and reliable way of thinking. Now I have an eye on it. I have tried a few things and it feels good. First, I would like to share the following:1) only two sub-cities are