-
Notifications
You must be signed in to change notification settings - Fork 6
/
Copy pathMBS.c
229 lines (203 loc) · 4.72 KB
/
MBS.c
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
/**
* Implementasi ADT Deque (Double-ended Queue)
*
* Dibuat dan ditulis oleh Bayu Laksana
* -- tanggal 22 Januari 2019
* Struktur Data 2020
* Implementasi untuk bahasa C
*
* !!NOTE!!
* cara menggunakan lihat pada fungsi main()
*/
#include <stdlib.h>
#include <stdbool.h>
#include <stdio.h>
/* Struktur Node */
typedef struct dnode_t {
int data;
struct dnode_t \
*next,
*prev;
} DListNode;
/* Struktur ADT Deque */
/* Implementasi didasarkan pada Doubly-Linked List */
typedef struct deque_t {
DListNode \
*_head,
*_tail;
unsigned _size;
} Deque;
/* DAFTAR FUNGSI YANG TERSEDIA */
DListNode* __dlist_createNode(int value);
void deq_init(Deque *deque);
bool deq_isEmpty(Deque *deque);
void deq_pushFront(Deque *deque, int value);
void deq_pushBack(Deque *deque, int value);
int deq_front(Deque *deque);
int deq_back(Deque *deque);
void deq_popFront(Deque *deque);
void deq_popBack(Deque *deque);
int main(int argc, char const *argv[])
{
// deq_init(&data1);
int i,j,n,jumlah,count1,count2,max;
scanf("%d",&n);
bool stop;
int na,nb,batas,x;
while(n)
{
Deque data1;
deq_init(&data1);
stop=false;
jumlah=0;
max=0;
count1=0;
count2=0;
scanf("%d %d %d",&na,&nb,&batas);
while(na)
{
// printf("a")-;
scanf("%d",&x);
if(jumlah+x > batas)
{
stop=true;
}
if(jumlah+x <= batas && !stop)
{
deq_pushBack(&data1,x);
jumlah+=x;
count1++;
}
// printf("%d\n",jumlah);
na--;
}
max=count1;
// printf("max: %d\n",max);
// stop=false;
while(nb)
{
// printf("b");
scanf("%d",&x);
jumlah+=x;
count2++;
// printf("%d!\n",jumlah);
while(jumlah>batas && !deq_isEmpty(&data1))
{
jumlah -= deq_back(&data1);
count1--;
deq_popBack(&data1);
}
// printf("%d\n",jumlah);
// printf("%d\n",jumlah);
if(max < count1+count2 && jumlah<=batas)
{
max=count1+count2;
}
// if(stop)
// break;
// printf("%d %d max: %d\n",count1,count2,max);
nb--;
}
printf("%d\n",max);
n--;
}
return 0;
}
/* Definisi Fungsi */
DListNode* __dlist_createNode(int value)
{
DListNode *newNode = \
(DListNode*) malloc (sizeof(DListNode));
if (!newNode) return NULL;
newNode->data = value;
newNode->next = NULL;
newNode->prev = NULL;
return (DListNode*) newNode;
}
void deq_init(Deque *deque)
{
deque->_head = deque->_tail = NULL;
deque->_size = (unsigned) 0;
}
bool deq_isEmpty(Deque *deque) {
return (deque->_head == NULL && \
deque->_tail == NULL);
}
void deq_pushFront(Deque *deque, int value)
{
DListNode *newNode = __dlist_createNode(value);
if (newNode) {
deque->_size++;
if (deq_isEmpty(deque)) {
deque->_head = newNode;
deque->_tail = newNode;
return;
}
newNode->next = deque->_head;
deque->_head->prev = newNode;
deque->_head = newNode;
}
}
void deq_pushBack(Deque *deque, int value)
{
DListNode *newNode = __dlist_createNode(value);
if (newNode) {
deque->_size++;
if (deq_isEmpty(deque)) {
deque->_head = newNode;
deque->_tail = newNode;
return;
}
deque->_tail->next = newNode;
newNode->prev = deque->_tail;
deque->_tail = newNode;
}
}
int deq_front(Deque *deque) {
if (!deq_isEmpty(deque)) {
return (deque->_head->data);
}
return 0;
}
int deq_back(Deque *deque) {
if (!deq_isEmpty(deque)) {
return (deque->_tail->data);
}
return 0;
}
void deq_popFront(Deque *deque)
{
if (!deq_isEmpty(deque)) {
DListNode *temp = deque->_head;
if (deque->_head == deque->_tail) {
deque->_head = NULL;
deque->_tail = NULL;
free(temp);
}
else {
deque->_head = deque->_head->next;
deque->_head->prev = NULL;
free(temp);
}
deque->_size--;
}
}
void deq_popBack(Deque *deque)
{
if (!deq_isEmpty(deque)) {
DListNode *temp;
if (deque->_head == deque->_tail) {
temp = deque->_head;
deque->_head = NULL;
deque->_tail = NULL;
free(temp);
}
else {
temp = deque->_tail;
deque->_tail = deque->_tail->prev;
deque->_tail->next = NULL;
free(temp);
}
deque->_size--;
}
}