Maverick

分类：分治 难度：1.5   题意：给定矩阵a，求s=a^1+…+a^k，结果mod m。矩阵乘法，两次分治，计算a^k和a^1+…+a^k。即a^k=(a*a)^(k/2), a^1+...+a^k=a^1+...a^(k/2) + a^(k/2) * [ a^1+...a^(k/2) ]。 #include #include int n,k,m; const int N = 3

Given n non-negative integers representing the histogram's bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. Above is a histogram where width o