116A - Tram - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

ans=0
x=0
for i in range(int(input())):
    a,b=map(int,input().split())
    x=x-a
    ans=max(ans,x)
    x=x+b
    ans=max(ans,x)
print(ans)

C++ Code:

#include<bits/stdc++.h>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <utility>
#include <set>
using namespace std;

int main()
{long long b ;
cin >> b ;
long long   n[b] ,m[b] , s = 0, d[b] , v=0;
for(int i = 0 ; i < b ; i++)
{
    cin >> n[i] >> m[i];
    s+= m[i];
    s+= - n[i];
 d[i]= s;
 if(v < d[i])
 {
     v = d[i];
 }

 }

 cout << v  << endl;

    return 0;}


Comments

Submit
0 Comments
More Questions

46A - Ball Game
114A - Cifera
776A - A Serial Killer
25B - Phone numbers
1633C - Kill the Monster
1611A - Make Even
1030B - Vasya and Cornfield
1631A - Min Max Swap
1296B - Food Buying
133A - HQ9+
1650D - Twist the Permutation
1209A - Paint the Numbers
1234A - Equalize Prices Again
1613A - Long Comparison
1624B - Make AP
660B - Seating On Bus
405A - Gravity Flip
499B - Lecture
709A - Juicer
1358C - Celex Update
1466B - Last minute enhancements
450B - Jzzhu and Sequences
1582C - Grandma Capa Knits a Scarf
492A - Vanya and Cubes
217A - Ice Skating
270A - Fancy Fence
181A - Series of Crimes
1638A - Reverse
1654C - Alice and the Cake
369A - Valera and Plates