#include<iostream>
#include<vector>
#include "kanapka.h"
#include "message.h"
using namespace std;
long long index;
long long calcFront(long long n){
    long long global = 0;
    long long local = 0;
    index = 0;
    for(int i=0;i<n;++i){
        local+=GetTaste(i);
        if(local>global){
            global = local;
            index = i+1;
        }    
    }
}
long long calcBack(long long n){
    long long global = 0;
    long long local = 0;
    for(int i=n-1;i>=0;--i){
        local+=GetTaste(i);
        if(local>global){
            global = local;
            
        }    
    }
}
int main(){
    int nodes,myNode;
    long long n = GetN();
    long long front,back;
    nodes = NumberOfNodes();
    myNode = MyNodeId();
    if(nodes == 1){
        front = calcFront(n);
        if(index == n){
            cout<<front<<endl;
            return 0;
        }
        back = calcBack(n);
        
        cout<<(back+front)<<endl;
        return 0;
    }
    else if(nodes >= 2){
        if(myNode == 0){
            front = calcFront(n);
            if(index == n){
                cout<<front<<endl;
                return 0;
            }
            Receive(1);
            back = GetLL(1);
            cout<<(back+front)<<endl;
            return 0;
        }
        else if(myNode == 1){
            back = calcBack(n);
            PutLL(0,back);
            Send(0);
            return 0;
        }
    }
return 0;
}
        | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 | #include<iostream> #include<vector> #include "kanapka.h" #include "message.h" using namespace std; long long index; long long calcFront(long long n){ long long global = 0; long long local = 0; index = 0; for(int i=0;i<n;++i){ local+=GetTaste(i); if(local>global){ global = local; index = i+1; } } } long long calcBack(long long n){ long long global = 0; long long local = 0; for(int i=n-1;i>=0;--i){ local+=GetTaste(i); if(local>global){ global = local; } } } int main(){ int nodes,myNode; long long n = GetN(); long long front,back; nodes = NumberOfNodes(); myNode = MyNodeId(); if(nodes == 1){ front = calcFront(n); if(index == n){ cout<<front<<endl; return 0; } back = calcBack(n); cout<<(back+front)<<endl; return 0; } else if(nodes >= 2){ if(myNode == 0){ front = calcFront(n); if(index == n){ cout<<front<<endl; return 0; } Receive(1); back = GetLL(1); cout<<(back+front)<<endl; return 0; } else if(myNode == 1){ back = calcBack(n); PutLL(0,back); Send(0); return 0; } } return 0; } | 
 
            
         English
                    English