D. Maximum Diameter Graph

https://codeforc.es/contest/1082/problem/D

题意：构造一个图；节点i度数不超过a[i];且任意两点直径最长；

思路：构造一条链度数最少为2*n-2，不够就不能构造；先把度数超过1的连成一条链；度数1的就先插首尾可以增加长度，其他可以自然插；要考虑没有度数为1时~；为一的要注意置零不然后面插时插大于一的时会出错

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e6+9;
const int mod=998244353;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

stack<int>yi;
int a[maxn];
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n;
    cin>>n;
    int sum=0;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        sum+=a[i];
        if(a[i]==1) yi.push(i),a[i]=0;
    }
    if(sum<2*n-2)
    {
        cout<<"NO"<<endl;
        return 0;
    }
    int maxlen=(n-yi.size())+min(2,(int)yi.size())-1;
    cout<<"YES "<<maxlen<<endl;
    cout<<n-1<<endl;
    int u=-1;
    if(yi.size())
    {
        u=yi.top();
        yi.pop();
    }
    for(int i=1;i<=n;i++)
    {
        if(u==-1)
        {
            u=i;
            continue;
        }
        if(a[i]>1)
        {
            cout<<u<<" "<<i<<endl;
            a[i]--;
            a[u]--;
            u=i;
        }
    }
    for(int i=n;i>0;i--)
    {
        while(a[i]>0&&yi.size())//要先把度数为一的去掉
        {
            cout<<i<<" "<<yi.top()<<endl;;
            yi.pop();
            a[i]--;

        }
    }
	return 0;
}