zoukankan      html  css  js  c++  java
  • 【二分】【动态规划】Codeforces Round #393 (Div. 1) B. Travel Card

    水dp,加个二分就行,自己看代码。

    B. Travel Card
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    A new innovative ticketing systems for public transport is introduced in Bytesburg. Now there is a single travel card for all transport. To make a trip a passenger scan his card and then he is charged according to the fare.

    The fare is constructed in the following manner. There are three types of tickets:

    1. a ticket for one trip costs 20 byteland rubles,
    2. a ticket for 90 minutes costs 50 byteland rubles,
    3. a ticket for one day (1440 minutes) costs 120 byteland rubles.

    Note that a ticket for x minutes activated at time t can be used for trips started in time range from t to t + x - 1, inclusive. Assume that all trips take exactly one minute.

    To simplify the choice for the passenger, the system automatically chooses the optimal tickets. After each trip starts, the system analyses all the previous trips and the current trip and chooses a set of tickets for these trips with a minimum total cost. Let the minimum total cost of tickets to cover all trips from the first to the current is a, and the total sum charged before is b. Then the system charges the passenger the sum a - b.

    You have to write a program that, for given trips made by a passenger, calculates the sum the passenger is charged after each trip.

    Input

    The first line of input contains integer number n (1 ≤ n ≤ 105) — the number of trips made by passenger.

    Each of the following n lines contains the time of trip ti (0 ≤ ti ≤ 109), measured in minutes from the time of starting the system. All ti are different, given in ascending order, i. e. ti + 1 > ti holds for all 1 ≤ i < n.

    Output

    Output n integers. For each trip, print the sum the passenger is charged after it.

    Examples
    input
    3
    10
    20
    30
    output
    20
    20
    10
    input
    10
    13
    45
    46
    60
    103
    115
    126
    150
    256
    516
    output
    20
    20
    10
    0
    20
    0
    0
    20
    20
    10
    Note

    In the first example, the system works as follows: for the first and second trips it is cheaper to pay for two one-trip tickets, so each time 20 rubles is charged, after the third trip the system understands that it would be cheaper to buy a ticket for 90 minutes. This ticket costs 50rubles, and the passenger had already paid 40 rubles, so it is necessary to charge 10rubles only.

    #include<cstdio>
    #include<algorithm>
    using namespace std;
    int n,a[100010],f[100010];
    int main()
    {
    	freopen("b.in","r",stdin);
    	scanf("%d",&n);
    	for(int i=1;i<=n;++i)
    	  scanf("%d",&a[i]);
    	for(int i=1;i<=n;++i)
    	  {
    	  	f[i]=f[i-1]+20;
    	  	int *p=lower_bound(a+1,a+n+1,a[i]-89);
    	  	f[i]=min(f[i],f[p-a-1]+50);
    	  	p=lower_bound(a+1,a+n+1,a[i]-1439);
    	  	f[i]=min(f[i],f[p-a-1]+120);
    	  	printf("%d
    ",f[i]-f[i-1]);
    	  }
    	return 0;
    }
  • 相关阅读:
    关于接口是值类型还是引用类型的猜测
    絮语工作四年的碎碎念
    烧钱游戏加入创业公司的一些感想
    关于C#调用非托管动态库方式的性能疑问
    couchbase作为分布式session容器时的注意事项
    poj3624
    明天的下载链接
    poj 1502
    poj1459 多源多汇最大流
    poj 3041
  • 原文地址:https://www.cnblogs.com/autsky-jadek/p/6343293.html
Copyright © 2011-2022 走看看