Submission #93937

#	Time	Username	Problem	Language	Result	Execution time	Memory
93937		ahmedie404	Nizin (COCI16_nizin)	C++14	100 / 100	158 ms	10236 KiB

nizin

#include <iostream>

using namespace std;

const int MAXN = 1e6 + 10;

int n, nus=0;
long long a[MAXN];

int main()
{
    cin >> n;

    for(int i=0;i<n;i++) cin>>a[i];

    int mi=0, ma=n-1;

    while(ma > mi){

        if(a[ma] == a[mi]){
            mi++;
            ma--;
            continue;
        }

        if(a[ma] > a[mi]){
            a[mi+1] += a[mi];
            mi++;
        } else {
            a[ma-1] += a[ma];
            ma--;
        }

        nus++;

    }

    cout << nus << endl;

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10