poj 1716 Integer intervals (差分约束#3 /贪心)

两种方法

 

#include <cstdio>
#include <algorithm>
#include <cstdlib> 
#include <cstring>
#include <vector> 
#define N 10005 
using namespace std; 
const int inf = (-1u >> 1);

struct intval{
       int l, r;
};
intval s[N]; 
bool cmp(const intval& a, const intval& b)
{
     return a.r < b.r;
} 

int main()
{
      int n;
      intval t;
      vector<int> ans; 
      scanf("%d", &n); 
      for (int i = 0; i < n; i++) 
            scanf("%d %d", &s[i].l, &s[i].r);
      sort(s, s + n, cmp); 
      //for (int i = 0; i < n; i++)printf("%d ", s[i].r);puts(""); 
      ans.push_back(s[0].r - 1); 
      ans.push_back(s[0].r);
      for (int i = 1; i < n; i++)
      {
            if (s[i].l > ans.back())ans.push_back(s[i].r - 1), ans.push_back(s[i].r);
            else if (s[i].l < ans.back())
            {
                 int tt = ans[ans.size() - 2]; 
                 if (tt < s[i].l) ans.push_back(s[i].r);
            } 
            else if (s[i].l == ans.back())ans.push_back(s[i].r); 
      }
      printf("%d\n", (int)ans.size());
    //  getchar(); 
} 
                 
             
             

 

 

#include <cstdio>
#include <algorithm>
#include <queue> 
#include <cstdlib> 
#include <cstring> 
#define N 10005 
#define M 50000 
//  d[i]的初始化 
using namespace std; 
const int inf = (-1u >> 1); 
int e; 
struct intval{
       int l, r;
};
intval s[N];
int d[N], first[N];
int u[M], v[M] , w[M], next[M]; 
bool inq[N]; 
void addE(int x, int y, int c)
{
      next[e] = first[x], first[x] = e;
      u[e] = x, v[e] = y;
      w[e] = c; 
      e++;
} 
int SPFA(int s, int n)
{
       for (int i = 0; i < n; i++)d[i] =  -inf;
       d[0] = 0; 
       queue<int> q;
       for (int i = 0; i < n; i++)inq[i] = false; 
       q.push(s); 
       while (!q.empty())
       {
              int x = q.front();q.pop();
              inq[x] = false;
              for (int e = first[x]; e != -1; e = next[e])if (d[v[e]] < d[u[e]] + w[e])
              {
                    d[v[e]] = d[u[e]] + w[e]; 
                    if (!inq[v[e]])
                    {
                              inq[v[e]] = true;
                              q.push(v[e]);
                    }
              }
       }
       return d[n - 1];
}


int main()
{
      int n, m;
   //   FILE* fp = fopen("in.txt", "r"); 
      while (scanf(  "%d", &m) != EOF)
      { 
            int a, b;
            n = -(inf); 
            e = 0;
            for (int i = 0;i < m; i++)
            {
                  scanf( "%d %d", &s[i].l, &s[i].r);
                  n = max(n, s[i].r); 
            }
            for (int i = 0; i <= n + 1; i++)first[i] = -1;
            for (int i = 0; i < m; i++)
                 addE(s[i].l, s[i].r + 1, 2); 
            for (int i = 0; i <= n; i++)
            {
                  addE(i, i + 1, 0);
                  addE(i + 1, i, -1);
            }      
            printf("%d\n", SPFA(0, n + 2)); 
           // getchar(); 
      }
      return 0;
}