#include <string> #include <vector> #include <algorithm> #include <cmath> #include <set> #include <queue> #include <map> #include <cstdio> #include <iomanip> #include <sstream> #include <iostream> #include <cstring> #define REP(i,x,v)for(int i=x;i<=v;i++) #define REPD(i,x,v)for(int i=x;i>=v;i--) #define FOR(i,v)for(int i=0;i<v;i++) #define FORE(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define FOREACH(i,t) FORE(i,t) #define REMIN(x,y) (x)=min((x),(y)) #define REMAX(x,y) (x)=max((x),(y)) #define pb push_back #define sz size() #define mp make_pair #define fi first #define se second #define ll long long #define IN(x,y) ((y).find((x))!=(y).end()) #define un(v) v.erase(unique(ALL(v)),v.end()) #define LOLDBG #ifdef LOLDBG #define DBG(vari) cerr<<#vari<<" = "<<vari<<endl; #define DBG2(v1,v2) cerr<<(v1)<<" - "<<(v2)<<endl; #else #define DBG(vari) #define DBG2(v1,v2) #endif #define CZ(x) scanf("%d",&(x)); #define CZ2(x,y) scanf("%d%d",&(x),&(y)); #define CZ3(x,y,z) scanf("%d%d%d",&(x),&(y),&(z)); #define wez(x) int x; CZ(x); #define wez2(x,y) int x,y; CZ2(x,y); #define wez3(x,y,z) int x,y,z; CZ3(x,y,z); #define SZ(x) int((x).size()) #define ALL(x) (x).begin(),(x).end() #define tests int dsdsf;cin>>dsdsf;while(dsdsf--) #define testss int dsdsf;CZ(dsdsf);while(dsdsf--) using namespace std; typedef pair<int,int> pii; typedef vector<int> vi; template<typename T,typename TT> ostream &operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";} template<typename T> ostream &operator<<(ostream &s,vector<T> t){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; } inline void pisz (int x) { printf("%d\n", x); } #include "message.h" #include "maklib.h" int main() { ios_base::sync_with_stdio(0); int n=Size(); int myid=MyNodeId(); int ile=NumberOfNodes(); int pocz=myid*n/ile,kon=(myid+1)*n/ile; ll sum=0,mx=0,mn=0,best=0; REP(i,pocz,kon-1) { int x=ElementAt(i+1); sum+=x; REMAX(best,sum-mn); REMAX(mx,sum); REMIN(mn,sum); } PutLL(0,sum); PutLL(0,mx); PutLL(0,mn); PutLL(0,best); Send(0); ll wyn=0; ll s=0; ll amn=0; if (myid==0) { FOR(i,ile) { Receive(i); ll rsum=GetLL(i); ll rmx=GetLL(i); ll rmn=GetLL(i); ll rbest=GetLL(i); DBG(rbest); REMAX(wyn,sum+rmx-amn); REMAX(wyn,rbest); REMIN(amn,rmn+sum); sum+=rsum; } cout<<wyn<<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 <string> #include <vector> #include <algorithm> #include <cmath> #include <set> #include <queue> #include <map> #include <cstdio> #include <iomanip> #include <sstream> #include <iostream> #include <cstring> #define REP(i,x,v)for(int i=x;i<=v;i++) #define REPD(i,x,v)for(int i=x;i>=v;i--) #define FOR(i,v)for(int i=0;i<v;i++) #define FORE(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define FOREACH(i,t) FORE(i,t) #define REMIN(x,y) (x)=min((x),(y)) #define REMAX(x,y) (x)=max((x),(y)) #define pb push_back #define sz size() #define mp make_pair #define fi first #define se second #define ll long long #define IN(x,y) ((y).find((x))!=(y).end()) #define un(v) v.erase(unique(ALL(v)),v.end()) #define LOLDBG #ifdef LOLDBG #define DBG(vari) cerr<<#vari<<" = "<<vari<<endl; #define DBG2(v1,v2) cerr<<(v1)<<" - "<<(v2)<<endl; #else #define DBG(vari) #define DBG2(v1,v2) #endif #define CZ(x) scanf("%d",&(x)); #define CZ2(x,y) scanf("%d%d",&(x),&(y)); #define CZ3(x,y,z) scanf("%d%d%d",&(x),&(y),&(z)); #define wez(x) int x; CZ(x); #define wez2(x,y) int x,y; CZ2(x,y); #define wez3(x,y,z) int x,y,z; CZ3(x,y,z); #define SZ(x) int((x).size()) #define ALL(x) (x).begin(),(x).end() #define tests int dsdsf;cin>>dsdsf;while(dsdsf--) #define testss int dsdsf;CZ(dsdsf);while(dsdsf--) using namespace std; typedef pair<int,int> pii; typedef vector<int> vi; template<typename T,typename TT> ostream &operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";} template<typename T> ostream &operator<<(ostream &s,vector<T> t){s<<"{";FOR(i,t.size())s<<t[i]<<(i==t.size()-1?"":",");return s<<"}"<<endl; } inline void pisz (int x) { printf("%d\n", x); } #include "message.h" #include "maklib.h" int main() { ios_base::sync_with_stdio(0); int n=Size(); int myid=MyNodeId(); int ile=NumberOfNodes(); int pocz=myid*n/ile,kon=(myid+1)*n/ile; ll sum=0,mx=0,mn=0,best=0; REP(i,pocz,kon-1) { int x=ElementAt(i+1); sum+=x; REMAX(best,sum-mn); REMAX(mx,sum); REMIN(mn,sum); } PutLL(0,sum); PutLL(0,mx); PutLL(0,mn); PutLL(0,best); Send(0); ll wyn=0; ll s=0; ll amn=0; if (myid==0) { FOR(i,ile) { Receive(i); ll rsum=GetLL(i); ll rmx=GetLL(i); ll rmn=GetLL(i); ll rbest=GetLL(i); DBG(rbest); REMAX(wyn,sum+rmx-amn); REMAX(wyn,rbest); REMIN(amn,rmn+sum); sum+=rsum; } cout<<wyn<<endl; } return 0; } |