Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <stdlib.h>
- #include <string.h>
- using namespace std;
- /* Driver program to test above function */
- int main()
- {
- // read data
- int n1, n2, n3, i;
- cin >> n1 >> n2 >> n3;
- int* s1 = new int[n1]; int* s2 = new int[n2]; int* s3 = new int[n3];
- for(i=0; i<n1;i++) cin >> s1[i];
- for(i=0; i<n2;i++) cin >> s2[i];
- for(i=0; i<n3;i++) cin >> s3[i];
- // manipulate data
- for(i=n1-2;i>=0;i--) s1[i] += s1[i+1];
- for(i=n2-2;i>=0;i--) s2[i] += s2[i+1];
- for(i=n3-2;i>=0;i--) s3[i] += s3[i+1];
- // find the best pair
- int i1 = 0, i2 = 0, i3 = 0;
- while(i1<n1 && i2<n2 && i3<n3) {
- if(s1[i1] == s2[i2] && s1[i1] == s3[i3]) {
- cout << s1[i1];
- return 0;
- } else {
- if(s1[i1] > s2[i2] && s1[i1] > s3[i3]) {
- i1++;
- } else if(s2[i2] > s3[i3]) {
- i2++;
- } else {
- i3++;
- }
- }
- }
- cout << 0;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement