215672026-01-13 16:20:55algoproLeggyorsabb pénzkeresés (50)cpp17Wrong answer 0/50300ms1076 KiB
// UUID: 797d5382-ba9e-43f5-a27f-7afc7f3a0bff
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N=0;
	int P=0;

	cin >> N;
	cin >> P;

	vector<int>money(N);
	for (int i=0; i<N; i++) {
		cin >> money[i];
	}
	
	int highest=0;
	
	for (int i1=0; i1<N; i1++) {
		int counter=0;
		for (int i2=i1; i2<N; i2++) {
			counter+=money[i2];
		}
		if (counter>highest) {
			highest=counter;
		}
	}

	cout << highest;
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms508 KiB
2Time limit exceeded0/0282ms564 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/235ms316 KiB
7Wrong answer0/235ms436 KiB
8Wrong answer0/234ms508 KiB
9Wrong answer0/234ms316 KiB
10Wrong answer0/234ms432 KiB
11Time limit exceeded0/2284ms568 KiB
12Time limit exceeded0/2298ms564 KiB
13Time limit exceeded0/2300ms564 KiB
14Time limit exceeded0/2289ms564 KiB
15Time limit exceeded0/2282ms1040 KiB
16Time limit exceeded0/2298ms568 KiB
17Time limit exceeded0/2300ms564 KiB
18Time limit exceeded0/2280ms748 KiB
19Time limit exceeded0/2273ms564 KiB
20Time limit exceeded0/2300ms564 KiB
21Time limit exceeded0/2298ms564 KiB
22Time limit exceeded0/2280ms1076 KiB
23Time limit exceeded0/2287ms564 KiB
24Time limit exceeded0/2291ms564 KiB
25Time limit exceeded0/2291ms564 KiB
26Time limit exceeded0/2289ms756 KiB
27Time limit exceeded0/2279ms564 KiB