标签:
Alice is playing a new game recently. In this game, there are
Alice is asked to divide them into
the sequences are labeled
the LCS(longest common subsequence) of
Now Alice is wondering the maximum points she can get.
As is known to everyone of you, Bob loves Alice very much. Could you tell Bob the answer to help Bob leave a good impression on Alice.
The first line contains
The second line contains
It is guaranteed that
Print the answer module 1000000007 in one line.
Sample Input | Sample Output |
---|---|
2 2 2 3 |
2 |
#include <iostream> #include <cstdio> using namespace std; const int HASH = 1000000007; int main() { int m, n, c; long long ans = 0; scanf("%d%d", &m, &n); for(int i = 1; i <= n; i++){ scanf("%d", &c); ans = (ans + (c/m)*(m*(m-1)/2) + (c%m)*(c%m-1)/2) % HASH; } printf("%lld", ans); return 0; }
标签:
原文地址:http://blog.csdn.net/prolightsfxjh/article/details/51029788