Graveyard Design POJ - 2100（尺取法）

最新推荐文章于 2021-05-05 20:25:29 发布

starlet_kiss

最新推荐文章于 2021-05-05 20:25:29 发布

阅读量213

点赞数 2

文章标签：尺取法

本文链接：https://blog.csdn.net/starlet_kiss/article/details/105435829

版权

King George has recently decided that he would like to have a new design for the royal graveyard. The graveyard must consist of several sections, each of which must be a square of graves. All sections must have different number of graves.
After a consultation with his astrologer, King George decided that the lengths of section sides must be a sequence of successive positive integer numbers. A section with side length s contains s 2 graves. George has estimated the total number of graves that will be located on the graveyard and now wants to know all possible graveyard designs satisfying the condition. You were asked to find them.
Input
Input file contains n — the number of graves to be located in the graveyard (1 <= n <= 10 14 ).
Output
On the first line of the output file print k — the number of possible graveyard designs. Next k lines must contain the descriptions of the graveyards. Each line must start with l — the number of sections in the corresponding graveyard, followed by l integers — the lengths of section sides (successive positive integer numbers). Output line’s in descending order of l.
Sample Input
2030
Sample Output
2
4 21 22 23 24
3 25 26 27
思路：这个就是比较简单的尺取问题了。两个指针，记录这两个指针之间的数的平方和。大了就l++,小了就r++.
代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define ll long long
using namespace std;

const int maxx=1e5+100;
ll n;
vector<ll> p[maxx];

int main()
{
	while(~scanf("%lld",&n))
	{
		ll m=sqrt(n)+10;
		for(int i=0;i<maxx;i++) p[i].clear();
		ll l=1,r=1;
		ll ans=0;
		ll cnt=0;
		while(r<=m)
		{
			if(ans==n)
			{
				for(ll i=l;i<r;i++) p[cnt].push_back(i);
				cnt++;
				ans-=l*l;
				l++;
			}
			else if(ans<n) ans+=r*r,r++;
			else ans-=l*l,l++;
		}
		printf("%lld\n",cnt);
		for(int i=0;i<cnt;i++)
		{
			printf("%d",p[i].size());
			for(int j=0;j<p[i].size();j++) printf(" %lld",p[i][j]);
			printf("\n");
		}
	}
	
	return 0;
}