zoukankan      html  css  js  c++  java
  • B

    B - Smartphone Addiction 

    简单模拟题,几个需要进行判断的点:

    ①. 到第一个咖啡馆时有没有电

    ②. 在咖啡馆充满电后就不能再充电了

    ③. 从咖啡馆回家后有没有电

     1 #include <bits/stdc++.h>
     2 using namespace std;
     3 
     4 int a[1010], b[1010];
     5 int main(){
     6     int n, m, t;
     7     cin >> n >> m >> t;
     8     for(int i = 1; i <= m; i ++)
     9         cin >> a[i] >> b[i];
    10     if(n - a[1] <= 0){
    11         cout << "No" << endl;
    12         return 0;
    13     }else{
    14         int sum1 = 0;
    15         sum1 = n - a[1];
    16         for(int i = 1; i <= m - 1; i ++){
    17             if(sum1 + b[i] - a[i] >= n)
    18                 sum1 = n;
    19             else
    20                 sum1 += b[i] - a[i];
    21                 
    22             if(sum1 - a[i + 1] + b[i] <= 0){
    23                 cout << "No" << endl;
    24                 return 0;
    25             }else
    26                 sum1 -= (a[i + 1] - b[i]);
    27         }
    28         if(sum1 + b[m] - a[m] >= n)
    29             sum1 = n;
    30         else
    31             sum1 += b[m] - a[m];
    32             
    33         if(sum1 - (t - b[m]) <= 0){
    34             cout << "No" << endl;
    35             return 0;
    36         }
    37         cout << "Yes" << endl;
    38     }
    39     
    40     
    41     return 0;
    42 }
  • 相关阅读:
    redis
    docker :no such file or directory
    删除Linux的用户
    lunux系统安全
    centos7.4yum错误
    POI2014 HOT-Hotels
    POI2009 KON-Ticket Inspector
    CF140E New Year Garland
    CF392B Tower of Hanoi
    落谷 P2401 不等数列
  • 原文地址:https://www.cnblogs.com/pureayu/p/14133028.html
Copyright © 2011-2022 走看看