[貪心 構造] SRM 717 div1 ScoresSequence

首先他保證圖唯一確定，那麼可以把圖給構出來
類似這個題，按照出度從大到小排序，出度最大那個點怎麼分配，類似無向圖可圖判定，應該是向出度小的點連，使得出度大的向他連，讓出度大的出度減小

// BEGIN CUT HERE  
#include<conio.h>
#include<sstream>
// END CUT HERE  
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<string>
#include<set>
#define cl(x) memset(x,0,sizeof(x))
using namespace std;
typedef long long ll;
typedef pair<int,int> abcd;


const int N=105;

int n;
abcd a[N];
int f[N][N];

class ScoresSequence{
public:
  int count(vector <int> s){
    n=s.size();
    for (int i=1;i<=n;i++) a[i]=abcd(s[i-1],i); cl(f);
    for (int i=1;i<=n;i++) f[i][i]=1;
    int t=n;
    while (t){
      sort(a+1,a+t+1);
      if (a[t].first==0) break;
      for (int i=1;i<=a[t].first;i++)
    f[a[t].second][a[i].second]=1;
      for (int i=a[t].first+1;i<t;i++)
    f[a[i].second][a[t].second]=1,a[i].first--;
      t--;
    }
    for (int k=1;k<=n;k++)
      for (int i=1;i<=n;i++)
    for (int j=1;j<=n;j++)
      f[i][j]|=f[i][k]&f[k][j];
    int ans=0;
    for (int i=1;i<=n;i++)
      for (int j=1;j<=n;j++)
    ans+=f[i][j];
    return ans;
  }


  // BEGIN CUT HERE
public:
  void run_test(int Case) { if ((Case == -1) || (Case == 0)) test_case_0(); if ((Case == -1) || (Case == 1)) test_case_1(); if ((Case == -1) || (Case == 2)) test_case_2(); if ((Case == -1) || (Case == 3)) test_case_3(); if ((Case == -1) || (Case == 4)) test_case_4(); }
private:
  template <typename T> string print_array(const vector<T> &V) { ostringstream os; os << "{ "; for (typename vector<T>::const_iterator iter = V.begin(); iter != V.end(); ++iter) os << '\"' << *iter << "\","; os << " }"; return os.str(); }
  void verify_case(int Case, const int &Expected, const int &Received) { cerr << "Test Case #" << Case << "..."; if (Expected == Received) cerr << "PASSED" << endl; else { cerr << "FAILED" << endl; cerr << "\tExpected: \"" << Expected << '\"' << endl; cerr << "\tReceived: \"" << Received << '\"' << endl; } }
  void test_case_0() { int Arr0[] = {2, 0, 1}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 6; verify_case(0, Arg1, count(Arg0)); }
  void test_case_1() { int Arr0[] = {1, 0, 2}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 6; verify_case(1, Arg1, count(Arg0)); }
  void test_case_2() { int Arr0[] = {1, 1, 1}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 9; verify_case(2, Arg1, count(Arg0)); }
  void test_case_3() { int Arr0[] = {0, 2, 8, 4, 3, 9, 1, 5, 7, 6}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 55; verify_case(3, Arg1, count(Arg0)); }
  void test_case_4() { int Arr0[] = {22,20,14,13,17,15,12,18,23,15,21,26,33,5,19,9,37,0,25,28,4,12,35,32,25,7,31,6,2,29,10,33,36,27,39,28,40,3,8,38,3}; vector <int> Arg0(Arr0, Arr0 + (sizeof(Arr0) / sizeof(Arr0[0]))); int Arg1 = 1422; verify_case(4, Arg1, count(Arg0)); }

  // END CUT HERE

};

// BEGIN CUT HERE
int main(){
  ScoresSequence ___test;
  ___test.run_test(-1);
  getch() ;
  return 0;
}
// END CUT HERE