题解见X姐的论文 矩阵乘法递推的优化，只是mark一下。。
{CSDN:CODE:447036}...
分类：
其他好文 时间：
2014-08-10 15:48:30
阅读次数：
197
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given[100, 4, 200, 1, 3, 2],The longest ...
分类：
其他好文 时间：
2014-08-10 15:33:50
阅读次数：
166
Given a string containing just the characters'(',')','{','}','['and']', determine if the input string is valid.The brackets must close in the correct ...
分类：
其他好文 时间：
2014-08-10 15:23:20
阅读次数：
215
CO-PRIME时间限制：1000ms | 内存限制：65535KB难度：3描述This problem is so easy! Can you solve it?You are given a sequence which contains n integers a1,a2……an, your t...
分类：
其他好文 时间：
2014-08-10 10:18:40
阅读次数：
250
Problem Description
PM Room defines a sequence A = {A1, A2,..., AN}, each of which is either 0 or 1. In order
to beat him, programmer Moor has to construct another sequence B = {B1, B2,... , BN} of...
分类：
其他好文 时间：
2014-08-09 21:34:09
阅读次数：
365
Problem Description
The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that satisfy i aj. For a given sequence of numbers a1, a2, ..., an, if we move t...
分类：
其他好文 时间：
2014-08-09 18:48:38
阅读次数：
241
CO-PRIME
时间限制：1000 ms | 内存限制：65535 KB
难度：3
描述
This problem is so easy! Can you solve it?
You are given a sequence which contains n integers a1,a2……an, your task is to find how man...
分类：
其他好文 时间：
2014-08-09 18:46:38
阅读次数：
244
Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to play it.
Given a sequence a consisting of n integ...
分类：
其他好文 时间：
2014-08-09 11:42:48
阅读次数：
311
# include # include using namespace std;int main(){ int n,m,i,sum,cot,flag,j; int map[80040]; int a[40010]; int ans1; int ans2; while(~scanf("%d%d",&n...
分类：
其他好文 时间：
2014-08-09 11:12:47
阅读次数：
245
/*Number Sequence
Problem Description
A number sequence is defined as follows:
f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.
Given A, B, and n, you are to calculate the value of ...
分类：
其他好文 时间：
2014-08-08 21:29:16
阅读次数：
386
