A. Power Consumption Calculation

http://codeforces.com/problemset/problem/10/A

题很简单，就是题意难懂啊。。。

#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
const int N=102;
struct node
{
    int l,r;
} g[N];
int main()
{
    int n,p1,p2,p3,t1,t2;
    while(cin>>n>>p1>>p2>>p3>>t1>>t2)
    {
        int sum = 0;
        for (int i = 1; i <= n; i++)
        {
            cin>>g[i].l>>g[i].r;
            sum+=(g[i].r-g[i].l)*p1;
        }
        for (int i = 2; i <= n; i++)
        {
            int x = g[i].l-g[i-1].r;
            sum+=min(x,t1)*p1;
            x-=min(x,t1);
            sum+=min(x,t2)*p2;
            x-=min(x,t2);
            sum+=x*p3;
        }
        cout<<sum<<endl;
    }
    return 0;
}