Submission #334126

#	Time	Username	Problem	Language	Result	Execution time	Memory
334126		Kerim	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	364 KiB

segments

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int arr[MAXN],n;
int solve(int x){
    int ans=1;
	ll cur=0,last=arr[1];
    for(int i=x+1;i<=n;i++){
    	cur+=arr[i];
		if(cur>=last){
			last=cur;
			ans++;cur=0;
		}
    }return ans;
}
int main(){
   // freopen("file.in", "r", stdin);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    	scanf("%d",arr+i);
    int st=1,en=n;
    while(st+1<en){
    	int mid=(st+en)>>1;
		if(solve(mid)<solve(mid+1))
			st=mid;
		else
			en=mid;	
    }printf("%d\n",max(solve(st),solve(en)));
	return 0;
}

Compilation message (stderr)

segments.cpp: In function 'int main()':
segments.cpp:34:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   34 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
segments.cpp:36:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   36 |      scanf("%d",arr+i);
      |      ~~~~~^~~~~~~~~~~~

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27