Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- int max(int a,int b){
- return (a > b ? a : b);
- }
- int main()
- {
- int n,m;
- scanf("%d %d",&n,&m);
- int land[n+1];for(int i=0;i<=n;i++)land[i] = 0;
- for(int i=0;i<m;i++){
- int l,r,h;
- scanf("%d %d %d",&l,&r,&h);
- for(int j=l;j<=r;j++)land[j] +=h;
- int maxh = -2e9;
- for(int j=1;j<=n;j++)maxh = max(maxh,land[j]);
- int CountRange = 0;
- bool isRange = false;
- for(int j=1;j<=n;j++){
- if(!isRange && land[j] == maxh){
- isRange = true;
- CountRange++;
- }
- else if(isRange && land[j] != maxh){
- isRange = false;
- }
- }
- printf("%d %d\n",maxh,CountRange);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment