BZOJ1595 [Usaco2008 Jan]人工湖

直接模拟。。。从最低的开始向两边拓展= =

 /**************************************************************
     Problem: 1595
     User: rausen
     Language: C++
     Result: Accepted
     Time:328 ms
     Memory:3932 kb
 ****************************************************************/

 #include <cstdio>

 using namespace std;
 typedef long long ll;
 const int N = 1e5 + ;
 const ll inf = (ll) 1e18;

 inline int read();

 struct data {
     ll w, h;
     int pre, nxt;

     inline void get(int x) {
         w = read(), h = read();
         pre = x - , nxt = x + ;
     }
 } a[N];

 int n, now;
 ll now_ans, ans[N];

 int main() {
     int i;
     n = read();
     for (i = now = ; i <= n; ++i) {
         a[i].get(i);
         if (a[i].h < a[now].h) now = i;
     }
     a[].w = a[n + ].w = , a[].h = a[n + ].h = inf, a[].nxt = , a[n + ].pre = n;
 #define Pre a[now].pre
 #define Nxt a[now].nxt
     for (i = ; i <= n; ++i) {
         while (a[Pre].h < a[now].h) now = Pre;
         while (a[Nxt].h < a[now].h) now = Nxt;
         ans[now] = now_ans + a[now].w;
         a[Pre].nxt = Nxt, a[Nxt].pre = Pre;
         if (a[Pre].h < a[Nxt].h) {
             now_ans += a[now].w * (a[Pre].h - a[now].h);
             a[Pre].w += a[now].w, now = Pre;
         } else {
             now_ans += a[now].w * (a[Nxt].h - a[now].h);
             a[Nxt].w += a[now].w, now = Nxt;
         }
     }
     for (i = ; i <= n; ++i)
         printf("%lld\n", ans[i]);
     return ;
 }

 inline int read() {
     static int x;
     static char ch;
     x = , ch = getchar();
     while (ch < '' || '' < ch)
         ch = getchar();
     while ('' <= ch && ch <= '') {
         x = x *  + ch - '';
         ch = getchar();
     }
     return x;
 }