제출 #493095

#제출 시각아이디문제언어결과실행 시간메모리
493095irmuunBigger segments (IZhO19_segments)C++17
0 / 100
1 ms204 KiB
#include<bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define ff first #define ss second #define PI 3.14159265359 ll n,m,t,p,sum[500001],a[500001],b,c,d,e,f,i,j,k,mod=1000000007,mod1=998244353,MAX=1e18,ans; string s,u; ll df[101]; vector<ll>v; vector<ll>dv[101]; void dfs(ll x){ df[x]=1; for(ll i=0;i<dv[x].size();i++){ if(df[dv[x][i]]==0){ dfs(dv[x][i]); } } } ll fastPow(ll a,ll b){ ll d=1; while(b>0){ if(b%2==1){ d=d*a%mod; } b/=2; a=a*a%mod; } return d; } int main(){ cin>>n; sum[0]=0; for(i=1;i<=n;i++){ cin>>a[i]; sum[i]=sum[i-1]+a[i]; } ans=0; for(i=1;i<=n;i++){ k=1; d=i; e=sum[d]; for(j=i+1;j<=n;j++){ if(sum[j]-sum[d]>=e){ k++; e=sum[j]-sum[d]; d=j; } } ans=max(ans,k); } cout<<ans; }

컴파일 시 표준 에러 (stderr) 메시지

segments.cpp: In function 'void dfs(long long int)':
segments.cpp:15:17: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(ll i=0;i<dv[x].size();i++){
      |                ~^~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...