Problem_Solving/Codeforces Round 205 (Div. 2)- C. Find Maximum.cpp at master · assem2002/Problem_Solving · GitHub

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
//    std::setvbuf(stdout, nullptr, _IOFBF, BUFSIZ);   //(will neglect the c's stdio.h property of doing inline flushing with every line of code)
//std::ios_base::sync_with_stdio(false);   // (removes the interoperability that happens between C's stdio.h and iostream )

#include <iostream>
//#include<numeric>
//#include<vector>
#include<cmath>
//#include<stack>
//#include <iomanip>
//#include <vector>
#include<bits/stdc++.h>
//#include <bitset>
////#include<iomanip>
//#include <algorithm>
//#include<queue>
////#include<deque>
////#include<numeric>
//#include<set>
//#include<unordered_set>
//#include<map>
////#include<fstream>
//#include<sstream>
////#include <thread>
////#include <chrono>
//#include<cstring>
//#include<string>
//#include <unordered_map>
////#include <thread>
////#include<limits>
//
using namespace std;


int main(){
    int n;
    cin>>n;
    vector<int> data(n+1);
    data[0]=0;
    long long totalgood =0;
    for(int i =1;i<=n;++i){
        int temp;
        cin>>temp;
        totalgood+=temp;
        data[i] = temp;
    }
    string seq="1",t;
    cin>>t;
    seq+=t;
    int i=n;
    for(;i>=0 ;--i){
        if(seq[i]=='1') break;
        totalgood-=data[i];
    }
    long long maxi=0;
    for( ;i>=0 ; --i){
      if(seq[i]=='1'){
        maxi=max(maxi,totalgood-data[i]);
      }
      else{
        totalgood-=data[i];

      }
    }
    cout<<maxi;


}