Algorithm

Manacher

February 20, 2013 String No comments

note: This article comes from the Internet. Please contact me via lethic@163.com if there is any infringement.
lethic@163.com.

manacher,.
,.[……]

Read more

KMP:Marlon’s String

February 20, 2013 String No comments

Marlon’s StringTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
SubmitStatus
Description
Long long ago, there was a coder n[……]

Read more

KMP:Oulipo

February 20, 2013 String No comments

OulipoTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
SubmitStatusPractice_
Description
The French author Georges Perec[……]

Read more

KMP

February 20, 2013 String No comments

note: This article comes from the Internet. Please contact me via lethic@163.com if there is any infringement.
lethic@163.com.

MM

KMPKMPBA[……]

Read more

upper_bound()

February 20, 2013 STL No comments

upper_bound()number1,2,2,4.upper_bound(2)34,last
>

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
using namespace std;
 
void main()
{
    const int VECTOR_SIZE = 8 ;
 
    // Define a template class vector of int
    typedef vector<int, allocator<int> > IntVector ;
 
    //Define an iterator for template class vector of strings
    typedef IntVector::iterator IntVectorIt ;
 
    IntVector Numbers(VECTOR_SIZE) ;
 
    IntVectorIt start, end, it, location, location1;
 
    // Initialize vector Numbers
    Numbers[0] = 4 ;
    Numbers[1] = 10;
    Numbers[2] = 10 ;
    Numbers[3] = 30 ;
    Numbers[4] = 69 ;
    Numbers[5] = 70 ;
    Numbers[6] = 96 ;
    Numbers[7] = 100;
 
    start = Numbers.begin() ;   // location of first
                                // element of Numbers
 
    end = Numbers.end() ;       // one past the location
                                // last element of Numbers
 
    // print content of Numbers
    cout << "Numbers { " ;
    for(it = start; it != end; it++)
        cout << *it << " " ;
    cout << " }\n" << endl ;
 
    //return the last location at which 10 can be inserted
    // in Numbers
    location = lower_bound(start, end, 9) ;
	location1 = upper_bound(start, end, 10) ;
 
    cout << "Element 10 can be inserted at index "
        << location - start<< endl ;
	 cout << "Element 10 can be inserted at index "
        << location1 - start<< endl ;
}

lower_bound()

February 20, 2013 STL No comments

lower_bound()firstlastvalvallast

number4,10,11,30,69,70,96,100.3,9,111.pos

pos = lower_bound( number, number + 8, 3) – numberpos = 0.number0
po[……]

Read more

lower_bound Spider’s Web (CF#133)

February 20, 2013 STL No comments

Spider’s Web

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Paw th[……]

Read more

Sequence

February 20, 2013 Data Structure No comments

SequenceTime Limit:6000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticePOJ 2442
Description
Given m sequences, each[……]

Read more

I Hate It

February 20, 2013 Data Structure No comments

I Hate ItTime Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeHDU 1754
Description

Input

N[……]

Read more

February 20, 2013 Data Structure No comments

Time Limit:1000MS

BK Tree

February 20, 2013 Data Structure No comments

note: This article comes from the Internet. Please contact me via lethic@163.com if there is any infringement.
lethic@163.com.

1965Vladimir L[……]

Read more

February 20, 2013 Data Structure No comments

A –
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeHDU 1166
Description
CACDerekTidyAN,DerekTidyC[……]

Read more

multisetHoledox Eating

February 20, 2013 Data Structure No comments

note: This article comes from the Internet. Please contact me via lethic@163.com if there is any infringement.
lethic@163.com.

Holedox Eating
Ti[……]

Read more

February 20, 2013 Data Structure No comments

note: This article comes from the Internet. Please contact me via lethic@163.com if there is any infringement.
lethic@163.com.

priority_queue<in[……]

Read more

Party all the time

February 20, 2013 Number Theory No comments

Party All the Time
Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 829 Accepted Submissi[……]

Read more

February 20, 2013 Number Theory No comments

note: This article comes from the Internet. Please contact me via lethic@163.com if there is any infringement.
lethic@163.com.

[……]

Read more

String Change

February 20, 2013 Number Theory No comments

String change
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 370 Accepted Submission(s)[……]

Read more

Mark the Rope

February 20, 2013 Number Theory No comments

Mark the Rope

Time Limit: 20000/10000 MS (Java/Others)

Lucas

note: This article comes from the Internet. Please contact me via lethic@163.com if there is any infringement.
lethic@163.com.

[……]

Read more

arcane number1

Arcane Numbers 1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1687 Accepted Submissio[……]

Read more