-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHOTELS.cpp
71 lines (64 loc) · 1.15 KB
/
HOTELS.cpp
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
//DATE: 29/09/2015
//Author: Ramjeet Saran
//http://www.spoj.com/problems/HOTELS/
#include <bits/stdc++.h>
#define gc getchar_unlocked
#define pc putchar_unlocked
# define MAX(a,b) a>b ? a : b;
# define MIN(a,b) a<b ? a : b;
# define lli long long int
# define ull unsigned long long int
using namespace std;
void fastwrite(int inp){
int a=(inp<0)?-inp:inp;
char snum[20];
int i=0;
do
{
snum[i++]=a%10+48;
a=a/10;
}while(a!=0);
if(inp<0)
snum[i++]='-';
i--;
while(i>=0)
pc(snum[i--]);
pc('\n');
}
int fastread()
{
char sign='\0',c=gc();
int ret=0;
while((c<'0'||c>'9')&&c!='-'){c=gc();}
if(c=='-'){
sign='1';
c=gc();
}
while(c>='0'&&c<='9'){
ret=10*ret+c-48;
c=gc();
}
if(sign)ret=-ret;
return ret;
}
int main(){
int N, i, j;
ull M, current_max, max = 0;
N = fastread();
cin>>M;
int arr[N];
for(int i = 0; i < N; i++)
arr[i] = fastread();
i = 0;
j = 0;
current_max = max = 0;
while(j < N){
current_max += arr[j];
while(current_max > M && i < j)
current_max -= arr[i++];
if(current_max <= M)
max = MAX(max, current_max);
j++;
}
cout<<max<<endl;
}