极值问题（acme.cpp)

 已知 m、n 为整数，且满足下列两个条件： ① m、n∈{1，2，…，k}，即 1≤m，n≤k ②(－m*n－) 的平方＝1 你的任务是：编程输入正整数k(1≤k≤)，求一组满足上述两个条件的m、n ， 并且使＋的值最 大。例如，从键盘输入k=1995，则输出：m=987 n=1597。 1995 m=987 n=1597 【说明】 1≤k≤

代码

#include<bits/stdc++.h>
using namespace std;
long long wc[55]={0,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368,75025,121393,196418,317811,514229,832040,1346269,2178309,3524578,5702887,9227465,14930352,24157817,39088169,63245986,102334155,165580141,267914296,433494437,701408733,1000000000},js=2;
struct S{
	int b,e;
}cw[55];
int main(){
	freopen("acme.in","r",stdin);
	freopen("acme.out","w",stdout);
	long long ak;
	cin>>ak;
	cw[1].b=1;cw[1].e=2;
	if(ak==1){
		cout<<"m=1"<<endl<<"n=1";
	}
	for(int i=2;i<=43;i++){
		cw[i].b=cw[i-1].e+1;
		cw[i].e=cw[i].b+wc[i]-1;
	}
	cw[43].e=1000000000;
	for(int i=1;i<=43;i++){
		if(ak<=cw[i].e&&ak>=cw[i].b){
			cout<<"m="<<wc[i]<<endl<<"n="<<wc[i+1];
		}
	}
	return 0;
}