278A - Circle Line - CodeForces Solution


implementation *800

Please click on ads to support us..

Python Code:

ii = int(input())
l_d = list(map(int, input().split()))
p, q = map(int, input().split())

if p > q:
    t = p
    p = q
    q = t

print(min(sum(l_d[p - 1 : q - 1]), sum(l_d[:p - 1]) + sum(l_d[q - 1:])))

C++ Code:

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    int n;
    cin>>n;
    int arr[n];
    int sum=0;
    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
        sum=sum+arr[i];
    }
    int a,b;
    cin>>a>>b;

    if(a>b) swap(a,b);

    int sum1=0;
    for(int i=a-1;i<b-1;i++)
    {
        sum1=sum1+arr[i];
    }

    cout<<min(sum1,sum-sum1)<<endl;
    return 0;
}


Comments

Submit
0 Comments
More Questions

742A - Arpa’s hard exam and Mehrdad’s naive cheat
1492A - Three swimmers
1360E - Polygon
1517D - Explorer Space
1230B - Ania and Minimizing
1201A - Important Exam
676A - Nicholas and Permutation
431A - Black Square
474B - Worms
987B - High School Become Human
1223A - CME
1658B - Marin and Anti-coprime Permutation
14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits
1476E - Pattern Matching
1107A - Digits Sequence Dividing