Subarray Sums II

#include <iostream>
#include <vector>

using namespace std;

int main(){
    int a, obj;
    cin >> a >> obj;

    vector<int> sum(a);

    cin >> sum[0];

    for(int i=1;i<a; i++){
        int temp;
        cin >> temp;
        sum[i] = sum[i-1] + temp;
    }
    int cont = 0;
    for(int i=0;i<a; i++){
        for(int l=i; l<a; l++){
            if(i!=0){
                if((sum[l]-sum[i-1])==obj)++cont;
            }
            else{
                if(sum[l]==obj)++cont;

            }
        }
    }

    cout << cont << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: TIME LIMIT EXCEEDED

Test 19

Verdict: TIME LIMIT EXCEEDED

Test 20

Verdict: TIME LIMIT EXCEEDED

Test 21

Verdict: TIME LIMIT EXCEEDED

Test 22

Verdict: TIME LIMIT EXCEEDED

Test 23

Verdict: TIME LIMIT EXCEEDED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: TIME LIMIT EXCEEDED

Test 26

Verdict: TIME LIMIT EXCEEDED

Test 27

Verdict: TIME LIMIT EXCEEDED

Test 28

Verdict: TIME LIMIT EXCEEDED