ref

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int n, d[305], deg[1005];
vector<pair<int,int> > vec;
int main(){
	cin>>n;
	for(int i=1; i<=n; i++)
		scanf("%d", &d[i]);
	int l=1, r=n, q=d[n]+1, lst=0;
	for(int i=1; i<=q; i++){
		if(l<=r && q-i+deg[i]==d[r]){
			lst = 1;
			r--;
		}
		else if(l<=r && deg[i]==d[l]){
			lst = 0;
			l++;
		}
		if(lst){
			for(int j=i+1; j<=q; j++){
				deg[i]++; deg[j]++;
				vec.push_back(make_pair(i,j));
			}
		}
	}
	cout<<vec.size()<<endl;
	for(int i=0; i<vec.size(); i++)
		printf("%d %d\n", vec[i].first, vec[i].second);
	return 0;
}

相关文章:

  • 2022-12-23
  • 2021-10-30
  • 2022-12-23
  • 2022-12-23
  • 2021-04-30
  • 2021-07-05
  • 2021-11-21
  • 2022-02-13
猜你喜欢
  • 2021-06-28
  • 2022-01-03
  • 2022-12-23
  • 2021-12-28
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
相关资源
相似解决方案