题意:有一个m*n的矩阵,矩阵中每一列都有1-m个数字,并且每一行中相邻的两个数字的差的绝对值不大于1,。要求矩阵满足上述两个条件,每个矩阵存在一个y值, 矩阵中每一行的所有值的和用 sum i表示,y=min(sum1,sum2,……sum m),给出m和n,求可能的y的最小值。
链接:http://acm.hdu.edu.cn/showproblem.php?pid=4572
思路:数学推理,过程详见链接http://blog.csdn.net/catalyst1314/article/details/9017737
注意点:无
以下为AC代码:
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
12544222 | 2014-12-19 22:22:49 | Accepted | 4572 | 0MS | 1164K | 787 B | C++ | luminous11 |
#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
int main()
{
int m, n;
while ( cin >> m >> n )
{
cout << ( m * n - ( n - 1 ) / 2 * ( n - 1 ) / 2 ) << endl;
}
return 0;
}