#include <iostream> #include "kanapka.h" #include "message.h" using namespace std; int main() { long long tmpL=0,tmpR=0; long long iL=0,iR=GetN()-1; long long right=0,left=0; long long sum=0; for(long long i=0; i<GetN(); i++) { tmpL+=GetTaste(i); if(tmpL>left) { left=tmpL; iL=i; if(iR>iL) { if(sum<right+left) sum=right+left; } else break; } tmpR+=GetTaste(GetN()-1-i); if(tmpR>right) { right=tmpR; iR=GetN()-1-i; if(iR>iL) { if(sum<right+left) sum=right+left; } else break; } } if(right>sum) sum=right; if(left>sum) sum=left; //Send(sum); //Receive(0); if(MyNodeId()==0) cout << sum << endl; return 0; } /* int main() { //int tab[]={100,-2,-1,-1,-3,-5,100}; //int tab[]= {10,-2,5,-1,3,-5,1}; int tab[]= {2}; GetN(); GetTaste(0); //GetTaste(1); cout << GetTaste(1) << endl; return 0; int tabsize=sizeof(tab)/sizeof(int); int tmpL=0,tmpR=0; int iL=0,iR=tabsize-1; int right=0,left=0; int sum=0; for(int i=0; i<tabsize; i++) { tmpL+=tab[i]; if(tmpL>left) { left=tmpL; iL=i; if(iR>iL) { if(sum<right+left) sum=right+left; } else break; } tmpR+=tab[tabsize-1-i]; if(tmpR>right) { right=tmpR; iR=tabsize-1-i; if(iR>iL) { if(sum<right+left) sum=right+left; } else break; } } if(right>sum) sum=right; if(left>sum) sum=left; cout << left << endl; cout << right << endl; cout << sum<< endl; 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 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 | #include <iostream> #include "kanapka.h" #include "message.h" using namespace std; int main() { long long tmpL=0,tmpR=0; long long iL=0,iR=GetN()-1; long long right=0,left=0; long long sum=0; for(long long i=0; i<GetN(); i++) { tmpL+=GetTaste(i); if(tmpL>left) { left=tmpL; iL=i; if(iR>iL) { if(sum<right+left) sum=right+left; } else break; } tmpR+=GetTaste(GetN()-1-i); if(tmpR>right) { right=tmpR; iR=GetN()-1-i; if(iR>iL) { if(sum<right+left) sum=right+left; } else break; } } if(right>sum) sum=right; if(left>sum) sum=left; //Send(sum); //Receive(0); if(MyNodeId()==0) cout << sum << endl; return 0; } /* int main() { //int tab[]={100,-2,-1,-1,-3,-5,100}; //int tab[]= {10,-2,5,-1,3,-5,1}; int tab[]= {2}; GetN(); GetTaste(0); //GetTaste(1); cout << GetTaste(1) << endl; return 0; int tabsize=sizeof(tab)/sizeof(int); int tmpL=0,tmpR=0; int iL=0,iR=tabsize-1; int right=0,left=0; int sum=0; for(int i=0; i<tabsize; i++) { tmpL+=tab[i]; if(tmpL>left) { left=tmpL; iL=i; if(iR>iL) { if(sum<right+left) sum=right+left; } else break; } tmpR+=tab[tabsize-1-i]; if(tmpR>right) { right=tmpR; iR=tabsize-1-i; if(iR>iL) { if(sum<right+left) sum=right+left; } else break; } } if(right>sum) sum=right; if(left>sum) sum=left; cout << left << endl; cout << right << endl; cout << sum<< endl; return 0; }*/ |